3228 search results - page 297 / 646 » Computationally Sound Proofs |
149
click to vote
TAMC
2007
Springer
16 years 25 days ago
2007
Springer
We say that A ≤LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real γ, oracle B can also find patterns on ...
144
click to vote
CONCUR
2005
Springer
16 years 8 days ago
2005
Springer
We propose a formalisation of the notion of transaction, using a variant of CCS, RCCS, that distinguishes reversible and irreversible actions, and incorporates a distributed backtr...
153
click to vote
MFCS
2005
Springer
16 years 6 days ago
2005
Springer
We prove several results about the relations between injectivity and surjectivity for sand automata. Moreover, we begin the exploration of the dynamical behavior of sand automata ...
145
click to vote
MFCS
2004
Springer
16 years 2 days ago
2004
Springer
How hard is it to invert NP-problems? We show that all superlinearly certified inverses of NP problems are coNP-hard. To do so, we develop a novel proof technique that builds dia...
190
click to vote
RTSS
2003
IEEE
15 years 12 months ago
2003
IEEE
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue Ñ-server sys...