1653 search results - page 102 / 331 » Computer science and game theory |
FOCS
2010
IEEE
13 years 8 months ago
2010
IEEE
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
STACS
2009
Springer
14 years 4 months ago
2009
Springer
We extend the notion of randomness (in the version introduced by Schnorr) to computable Probability Spaces and compare it to a dynamical notion of randomness: typicality. Roughly, ...
139
click to vote
Tutorial
"These video lectures provide a thorough and unified treatment of adaptive filters and their performance. The lectures cover the fundamentals of linear estimation theory, adap...
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are ‘unique’ cons...
FOCS
1990
IEEE
14 years 2 months ago
1990
IEEE
d abstract) Noga Alon IBM Almaden Research Center, San Jose, CA 95120 and Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel Moni Naor IBM Almaden Research Ce...