210 search results - page 5 / 42 » On the Structure of Bounded Queries to Arbitrary NP Sets |
ECCC
2008
13 years 8 months ago
2008
Any proof of P = NP will have to overcome two barriers: relativization and natural proofs. Yet over the last decade, we have seen circuit lower bounds (for example, that PP does n...
ICALP
1992
Springer
14 years 20 days ago
1992
Springer
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
PODS
2003
ACM
14 years 8 months ago
2003
ACM
In this paper we study the following problem. Given a database and a set of queries, we want to find, in advance, a set of views that can compute the answers to the queries, such ...
FOCS
2000
IEEE
14 years 1 months ago
2000
IEEE
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
IJCAI
2007
13 years 10 months ago
2007
Conjunctive queries play an important role as an expressive query language for Description Logics (DLs). Although modern DLs usually provide for transitive roles, conjunctive quer...