2446 search results - page 39 / 490 » Choiceless Polynomial Time |
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
The purpose of this study is to measure the impact of C level code polynomial arithmetic on the performances of AXIOM highlevel algorithms, such as polynomial factorization. More p...
FCT
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. It is proved that everywhere-dense Min 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.
FCT
2009
Springer
14 years 2 months ago
2009
Springer
We study the equivalence problem of deterministic nested word to word transducers and show it to be suprisingly robust. Modulo polynomal time reductions, it can be identified with...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
SWAT
2010
Springer
13 years 5 months ago
2010
Springer
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...