2924 search results - page 382 / 585 » Lower Bounds in Distributed Computing |
130
click to vote
CIE
2007
Springer
15 years 6 months ago
2007
Springer
This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. The main result is that every infinite sequence S with constructive Hausdorff...
127
click to vote
AAAI
2006
15 years 6 months ago
2006
A contract algorithm is an algorithm which is given, as part of the input, a specified amount of allowable computation time. The algorithm must then compute a solution within the ...
147
click to vote
ENTCS
2008
15 years 4 months ago
2008
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
137
Voted
SIAMJO
2008
15 years 4 months ago
2008
This paper discusses how to find the global minimum of functions that are summations of small polynomials ("small" means involving a small number of variables). Some spa...
116
click to vote
ALGORITHMICA
2002
15 years 4 months ago
2002
We describe a quantum black-box network computing the majority of N bits with zerosided error using only 2 3 N + O( N log( -1 log N)) queries: the algorithm returns the correct an...