148 search results - page 8 / 30 » Formally Analyzing Expected Time Complexity of Algorithms Us... |
128
click to vote
ECCC
2007
15 years 2 months ago
2007
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
151
click to vote
CIE
2007
Springer
15 years 6 months ago
2007
Springer
We study computer virology from an abstract point of view. Viruses and worms are self-replicating programs, whose constructions are essentially based on Kleene's second recurs...
136
click to vote
CAV
2001
Springer
15 years 6 months ago
2001
Springer
We consider the randomized consensus protocol of Aspnes and Herlihy for achieving agreement among N asynchronous processes that communicate via read/write shared registers. The alg...
149
click to vote
COCO
2010
Springer
15 years 6 months ago
2010
Springer
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...
116
click to vote
CORR
2000
Springer
15 years 2 months ago
2000
Springer
The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncount...