We present an information-based complexity problem for which the computational complexity can be any given increasing function of the information complexity, and the information complexity can be any non-decreasing function of ε-1, where ε is the error parameter
We are interested in the complexity of the Poisson problem with homogeneous Dirichlet boundary condi...
AbstractContinuity and computability on Cantor's space C has turned out to be a very natural basis f...
Computational complexity . . . insightintothequestionwhycertaincomputationalproblems appeartobemored...
AbstractWe present an information-based complexity problem for which the computational complexity ca...
Estimating the complexity of implementation for a coding/decoding system is a delicate question. The...
Computational complexity studies the intrinsic difficulty of solving mathematically posed problems. ...
Computational complexity studies the intrinsic difficulty of solving mathematically posed problems. ...
Tesis (Lic. en Cs. de la Computación)--Universidad Nacional de Córdoba, Facultad de Matemática, Astr...
We study the complexity of 2mth order definite elliptic problems Lu=ƒ (with homogeneous Dirichlet bo...
This research in Theoretical Computer Science extends the gateways between Linear Logic and Complexi...
Hanasusanto et al. [HKW] has pointed out an error in the original publication of the article. To be...
AbstractWe generalize several methods for obtaining lower bounds for the complexity of polynomials, ...
We survey some recent results in information-based complexity, We focus on the worst case setting an...
Model theory has lately become a domain of interest to computer scientists. The reason is that model...
As the name of this symposium indicates, its scope is delimited in two ways. We concern ourselves wi...
We are interested in the complexity of the Poisson problem with homogeneous Dirichlet boundary condi...
AbstractContinuity and computability on Cantor's space C has turned out to be a very natural basis f...
Computational complexity . . . insightintothequestionwhycertaincomputationalproblems appeartobemored...
AbstractWe present an information-based complexity problem for which the computational complexity ca...
Estimating the complexity of implementation for a coding/decoding system is a delicate question. The...
Computational complexity studies the intrinsic difficulty of solving mathematically posed problems. ...
Computational complexity studies the intrinsic difficulty of solving mathematically posed problems. ...
Tesis (Lic. en Cs. de la Computación)--Universidad Nacional de Córdoba, Facultad de Matemática, Astr...
We study the complexity of 2mth order definite elliptic problems Lu=ƒ (with homogeneous Dirichlet bo...
This research in Theoretical Computer Science extends the gateways between Linear Logic and Complexi...
Hanasusanto et al. [HKW] has pointed out an error in the original publication of the article. To be...
AbstractWe generalize several methods for obtaining lower bounds for the complexity of polynomials, ...
We survey some recent results in information-based complexity, We focus on the worst case setting an...
Model theory has lately become a domain of interest to computer scientists. The reason is that model...
As the name of this symposium indicates, its scope is delimited in two ways. We concern ourselves wi...
We are interested in the complexity of the Poisson problem with homogeneous Dirichlet boundary condi...
AbstractContinuity and computability on Cantor's space C has turned out to be a very natural basis f...
Computational complexity . . . insightintothequestionwhycertaincomputationalproblems appeartobemored...
DOI
Add to ORKG