Sciweavers

1383 search results - page 18 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
ECCC
2007
89views more  ECCC 2007»
15 years 6 months ago
The black-box query complexity of polynomial summation
Ali Juma, Valentine Kabanets, Charles Rackoff, Ami...
307
Voted
NETWORKS
2008
15 years 6 months ago
The computational complexity of graph contractions II: Two tough polynomially solvable cases
Asaf Levin, Daniël Paulusma, Gerhard J. Woegi...
VLSISP
2010
127views more  VLSISP 2010»
15 years 1 months ago
An Efficient Method for Evaluating Complex Polynomials
Milos D. Ercegovac, Jean-Michel Muller
MST
2010
105views more  MST 2010»
15 years 5 months ago
On the Automatizability of Polynomial Calculus
Abstract We prove that Polynomial Calculus and Polynomial Calculus with Resolution are not automatizable, unless W[P]-hard problems are fixed parameter tractable by one-side error...
Nicola Galesi, Massimo Lauria