123 search results - page 3 / 25 » Derandomizing from Random Strings |
COCO
2010
Springer
13 years 11 months ago
2010
Springer
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
AAAI
2007
13 years 9 months ago
2007
String kernels directly model sequence similarities without the necessity of extracting numerical features in a vector space. Since they better capture complex traits in the seque...
FSE
2005
Springer
14 years 26 days ago
2005
Springer
Abstract. The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation, to search heuristics and game playing) i...
FOCS
2002
IEEE
14 years 9 days ago
2002
IEEE
STOC
2006
ACM
14 years 7 months ago
2006
ACM
: We derandomize results of H?astad (1999) and Feige and Kilian (1998) and show that for all > 0, approximating MAX CLIQUE and CHROMATIC NUMBER to within n1are NP-hard. We furt...