6142 search results - page 203 / 1229 » The Complexity of Partition Functions |
147
Voted
STACS
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. We compare classical and quantum query complexities of total Boolean functions. It is known that for worst-case complexity, the gap between quantum and classical can be a...
174
Voted
COCO
2000
Springer
15 years 8 months ago
2000
Springer
It is known that the classical and quantum query complexities of a total Boolean function f are polynomially related to the degree of its representing polynomial, but the optimal ...
141
Voted
MOR
2007
15 years 3 months ago
2007
This paper studies the possibilities of the Linear Matrix Inequality (LMI) characterization of the matrix cones formed by nonnegative complex Hermitian quadratic functions over sp...
144
Voted
CIE
2011
Springer
14 years 3 months ago
2011
Springer
Abstract. In [She82], it is shown that four of its basic functional properties are enough to characterize plain Kolmogorov complexity, hence obtaining an axiomatic characterization...
144
Voted
JCSS
2008
15 years 3 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...