2479 search results - page 108 / 496 » Quantum complexity theory |
192
click to vote
COCO
2008
Springer
15 years 8 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
282
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
For many years, finite model theory was viewed as the backbone of database theory, and database theory in turn supplied finite model theory with key motivations and problems. By n...
164
click to vote
EPIA
2005
Springer
15 years 12 months ago
2005
Springer
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
171
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
157
click to vote
ICALP
1997
Springer
15 years 10 months ago
1997
Springer
Despite the major role that modularity occupies in computer science, all the known results on modular analysis only treat particular problems, and there is no general unifying the...