13603 search results - page 67 / 2721 » On the Computational Complexity of Cut-Reduction |
137
click to vote
FOCS
1991
IEEE
15 years 9 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
161
click to vote
GD
2009
Springer
15 years 9 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...
173
click to vote
DAGSTUHL
2006
15 years 7 months ago
2006
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
168
click to vote
BMVC
2010
15 years 3 months ago
2010
We describe a new multiscale keypoint detector and a set of local visual descriptors, both based on the efficient Dual-Tree Complex Wavelet Transform. The detector has properties ...
153
click to vote
FLAIRS
1998
15 years 7 months ago
1998
In somecomplexdomains,like the gameof Go,evaluating a position is not simple. In other games,like Chessfor example,material balancegives goodandfast to compute insight onthe value...