2479 search results - page 70 / 496 » Quantum complexity theory |
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
LICS
2002
IEEE
14 years 3 months ago
2002
IEEE
We introduce three formal theories of increasing strength for linear algebra in order to study the complexity of the concepts needed to prove the basic theorems of the subject. We...
AII
1989
14 years 2 months ago
1989
This paper surveys recent results concerning the inference of deterministic finite automata (DFAs). The results discussed determine the extent to which DFAs can be feasibly inferr...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
e onsider prolem of deomposition of ternry funtion into omposition of iE nry ones from the viewpoint of ommuniE tion omplexity nd lgorithmi informtion theory s well s some pplit...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...