1331 search results - page 14 / 267 » Complexity bounds for zero-test algorithms |
STOC
2005
ACM
14 years 8 months ago
2005
ACM
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This ...
FOCS
1990
IEEE
13 years 11 months ago
1990
IEEE
The exponent of periodicity is an important factor in estimates of complexity of word-unification algorithms. We prove that the exponent of periodicity of a minimal solution of a w...
ERSHOV
2003
Springer
14 years 26 days ago
2003
Springer
We present several new algorithms as well as new lower and upper bounds for optimizing functions underlying infinite games pertinent to computer-aided verification.
DAM
1999
13 years 7 months ago
1999
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
STOC
2007
ACM
14 years 8 months ago
2007
ACM
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....