Sciweavers

3 search results - page 1 / 1
» An Oracle Strongly Separating Deterministic Time from Nondet...
Sort
View
CORR
2010
Springer
89views Education» more  CORR 2010»
13 years 4 months ago
An Oracle Strongly Separating Deterministic Time from Nondeterministic Time, via Kolmogorov Complexity
Hartmanis used Kolmogorov complexity to provide an alternate proof of the classical result of Baker, Gill, and Solovay that there is an oracle relative to which P is not NP. We re...
David Doty
COCO
1994
Springer
100views Algorithms» more  COCO 1994»
13 years 8 months ago
Relative to a Random Oracle, NP is Not Small
Resource-bounded measure as originated by Lutz is an extension of classical measure theory which provides a probabilistic means of describing the relative sizes of complexity clas...
Steven M. Kautz, Peter Bro Miltersen
IANDC
2007
152views more  IANDC 2007»
13 years 4 months ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner