4860 search results - page 409 / 972 » SNPs Problems, Complexity, and Algorithms |
107
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
89
Voted
ECCC
2010
15 years 3 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
108
click to vote
ECCC
2007
15 years 3 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
140
Voted
MST
2010
15 years 2 months ago
2010
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...
165
click to vote
TCSV
2008
15 years 3 months ago
2008
The objective of dynamic voltage scaling (DVS) is to adapt the frequency and voltage for configurable platforms to obtain energy savings. DVS is especially attractive for video dec...