15033 search results - page 115 / 3007 » Complexity Theory and Algorithms |
145
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
135
Voted
PODS
2010
ACM
15 years 8 months ago
2010
ACM
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
103
click to vote
IJCAI
2003
15 years 5 months ago
2003
We propose a framework for simple causal theories of action, and study the computational complexity in it of various reasoning tasks such as determinism, progression and regressio...
108
Voted
COCO
1998
Springer
15 years 8 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
124
click to vote
STOC
1994
ACM
15 years 7 months ago
1994
ACM
Razborov and Rudich have shown that so-called natural proofs are not useful for separating P from NP unless hard pseudorandomnumber generators do not exist. This famous result is ...