71 search results - page 7 / 15 » Resolution Proofs, Exponential Bounds, and Kolmogorov Comple... |
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We give an exponential separation between one-way quantum and classical communication protocols for two partial Boolean functions, both of which are variants of the Boolean Hidden...
IJCAI
1993
13 years 10 months ago
1993
In this paper a framework is developed for measuring the complexities of deductions in an ab stract and computationally perspicuous man ner. As a notion of central importance ...
VMCAI
2010
Springer
14 years 5 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
COCO
1995
Springer
14 years 4 days ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
FOCS
1990
IEEE
14 years 18 days ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...