1998 search results - page 94 / 400 » Complexity of the Cover Polynomial |
STOC
2007
ACM
14 years 10 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
ICML
2009
IEEE
14 years 11 months ago
2009
IEEE
We consider the exploration/exploitation problem in reinforcement learning (RL). The Bayesian approach to model-based RL offers an elegant solution to this problem, by considering...
STOC
2010
ACM
14 years 7 months ago
2010
ACM
The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside th...
FOCS
1998
IEEE
14 years 2 months ago
1998
IEEE
We present a higher-order functional notation for polynomial-time computation with arbitrary 0; 1-valued oracle. This provides a linguistic characterization for classes such as np...