Sciweavers

1383 search results - page 18 / 277
» On the Complexity of the Interlace Polynomial
Sort
View
62
Voted
ECCC
2007
89views more  ECCC 2007»
14 years 11 months ago
The black-box query complexity of polynomial summation
Ali Juma, Valentine Kabanets, Charles Rackoff, Ami...
VLSISP
2010
127views more  VLSISP 2010»
14 years 6 months ago
An Efficient Method for Evaluating Complex Polynomials
Milos D. Ercegovac, Jean-Michel Muller
MST
2010
105views more  MST 2010»
14 years 10 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