2200 search results - page 179 / 440 » Bloch's Constant is Computable |
183
click to vote
AAAI
1996
15 years 7 months ago
1996
It is known that bounds on the minimax values of nodes in a game tree can be used to reduce the computational complexity of minimax search for two-player games. We describe a very...
192
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We consider random instances of constraint satisfaction problems where each variable has domain size O(1), each constraint is on O(1) variables and the constraints are chosen from...
172
click to vote
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
We introduce another variant of Quantum MIP, where the provers do not share entanglement, the communication between the verifier and the provers is quantum, but the provers are u...
149
click to vote
ARCS
2010
Springer
15 years 6 months ago
2010
Springer
Processor speed and available computing power constantly increases, enabling computation of more and more complex problems such as numerical simulations of physical processes. In t...
166
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Recent years have seen a significant increase in our understanding of high-dimensional nearest neighbor search (NNS) for distances like the 1 and 2 norms. By contrast, our underst...