2661 search results - page 168 / 533 » Quantum Complexity Classes |
110
click to vote
MP
2006
15 years 3 months ago
2006
In this paper, we provide theoretical analysis for a cubic regularization of Newton method as applied to unconstrained minimization problem. For this scheme, we prove general local...
118
Voted
JLP
2010
15 years 1 months ago
2010
Various simplified or improved, and partly corrected well-known implicit characterizations of the complexity classes FPTIME and NC are presented. Primarily, the interest is in si...
121
Voted
TCOM
2010
14 years 10 months ago
2010
The class of variable-length finite-state joint source-channel codes is defined and a polynomial complexity algorithm for the evaluation of their distance spectrum presented. Issu...
156
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
128
Voted
TCC
2007
Springer
15 years 9 months ago
2007
Springer
We present a lower bound on the round complexity of a natural class of black-box constructions of statistically hiding commitments from one-way permutations. This implies a Ω( n ...