44 search results - page 6 / 9 » Kleene Theorems for Product Systems |
118
click to vote
CC
2008
Springer
15 years 1 months ago
2008
Springer
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- This paper demonstrates the effectiveness of simple control-theoretic tools in generating simulation-guided experiments on a synthetic in vitro oscillator. A theoretical...
ICITS
2009
14 years 11 months ago
2009
Abstract. The term indistinguishability amplification refers to a setting where a certain construction combines two (or more) cryptographic primitives of the same type to improve t...
158
click to vote
ICFP
2006
ACM
16 years 1 months ago
2006
ACM
I report on an experience using the Coq proof assistant to develop a program verification tool with a machine-checkable proof of full correctness. The verifier is able to prove me...
142
click to vote
COCO
2010
Springer
15 years 5 months ago
2010
Springer
A PCP is a proof system for NP in which the proof can be checked by a probabilistic verifier. The verifier is only allowed to read a very small portion of the proof, and in return ...