2446 search results - page 21 / 490 » Choiceless Polynomial Time |
SODA
2012
ACM
11 years 10 months ago
2012
ACM
Every finite field has many multiplicative generators. However, finding one in polynomial time is an important open problem. In fact, even finding elements of high order has n...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we study planar polynomial differential systems of this form: dX dt = X = A(X, Y ), dY dt = Y = B(X, Y ), where A, B Z[X, Y ] and deg A d, deg B d, A H and B H. ...
ISSAC
2011
Springer
12 years 10 months ago
2011
Springer
There are several algorithms for factoring in Z[x] which have a proven polynomial complexity bound such as Sch¨onhage of 1984, Belabas/Kl¨uners/van Hoeij/Steel of 2004, and vanH...
CIE
2008
Springer
13 years 9 months ago
2008
Springer