12 search results - page 1 / 3 » On Uniform Recurrence of a Direct Product |
DMTCS
2010
13 years 2 months ago
2010
A direct product of two words is a naturally defined word on the alphabet of pairs of symbols. We introduce the class URP of uniformly recurrent words such that a direct product o...
SIAMCOMP
2010
13 years 3 months ago
2010
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
COCO
2008
Springer
13 years 6 months ago
2008
Springer
Discrepancy is a versatile bound in communication complexity which can be used to show lower bounds in the distributional, randomized, quantum, and even unbounded error models of ...
TCC
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. We consider weakly-verifiable puzzles which are challengeresponse puzzles such that the responder may not be able to verify for itself whether it answered the challenge ...