395 search results - page 7 / 79 » Positive Versions of Polynomial Time |
JAT
2002
14 years 9 months ago
2002
We investigate polynomials satisfying a three-term recurrence relation of the form Bn(x) = (x - n)Bn-1(x) - nxBn-2(x), with positive recurrence coefficients n+1, n (n = 1, 2, . . ...
COCO
1998
Springer
15 years 2 months ago
1998
Springer
We show that MAEXP, the exponential time version of the Merlin-Arthur class, does not have polynomial size circuits. This significantly improves the previous known result due to K...
MOC
1998
14 years 9 months ago
1998
D. Wan very recently proved an asymptotic version of a conjecture of Hansen and Mullen concerning the distribution of irreducible polynomials over finite fields. In this note we ...
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We study the problem of asymptotically reducing the runtime of serial computations with circuits of polynomial size. We give an algorithmic size-depth tradeoff for parallelizing ...
IVC
2000
14 years 9 months ago
2000
The Art Gallery Problem deals with determining the number of observers necessary to cover an art gallery room such that every point is seen by at least one observer. This problem ...