2168 search results - page 36 / 434 » Randomized Algorithms and Complexity Theory |
117
click to vote
FSTTCS
1992
Springer
15 years 3 months ago
1992
Springer
Levin introduced an average-case complexity measure, based on a notion of \polynomialon average," and de ned \average-case polynomial-time many-one reducibility" amongra...
SODA
1997
ACM
15 years 1 months ago
1997
ACM
We give a polynomial-time algorithm for the following problem: Given a degree sequence in which each degree is bounded from above by a constant, select, uniformly at random, an un...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
ICRA
2007
IEEE
15 years 6 months ago
2007
IEEE
— One of the most important problems in Mobile Robotics is to realise the complete robot’s autonomy. In order to achieve this goal several tasks have to be accomplished. Among ...
FLAIRS
2003
15 years 1 months ago
2003
Researchers studying Evolutionary Algorithms and their applications have always been confronted with the sample complexity problem. The relationship between population size and gl...