13603 search results - page 176 / 2721 » On the Complexity of Computing Treelength |
119
click to vote
GI
2005
Springer
15 years 10 months ago
2005
Springer
: Rapid evolution of modern Information Systems and Process-Aware Information Systems (PAIS) in particular requires transactional execution of business logic. The paper introduces ...
144
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
135
click to vote
FOCS
1998
IEEE
15 years 8 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
122
click to vote
FOCS
1991
IEEE
15 years 8 months ago
1991
IEEE
Karchmer, Raz, and Wigderson, 1991, discuss the circuit depth complexity of n bit Boolean functions constructed by composing up to d = logn=loglogn levels of k = logn bit boolean
139
click to vote
GD
2009
Springer
15 years 7 months ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...