1331 search results - page 41 / 267 » Complexity bounds for zero-test algorithms |
WDAG
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
STOC
1996
ACM
13 years 12 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
CODCRY
2011
Springer
12 years 11 months ago
2011
Springer
We present the state of the art solvers of the Shortest and Closest Lattice Vector Problems in the Euclidean norm. We recall the three main families of algorithms for these problem...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. It is well-known that no classical algorithm can solve exactly (i.e., in bounded time without error) the leader election problem in anonymous networks. This paper propose...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...