3341 search results - page 61 / 669 » On Bounded Queries and Approximation |
COCO
1989
Springer
15 years 1 months ago
1989
Springer
Kadin [6] showed that if the Polynomial Hierarchy (PH) has infinitely many levels, then for all k, PSAT[k] ⊂ PSAT[k+1]. This paper extends Kadin’s technique and shows that a p...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Relational joins are at the core of relational algebra, which in turn is the core of the standard database query language SQL. As their evaluation is expensive and very often domi...
AI
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of finding an unknown graph by using two types of queries with an additive property. Given a graph, an additive query asks the number of edges in a set of ...
COCO
2007
Springer
15 years 4 months ago
2007
Springer
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
MOC
1998
14 years 9 months ago
1998
Abstract. We consider a class of nonconforming finite element approximations of a simply laminated microstructure which minimizes the nonconvex variational problem for the deforma...