Sciweavers

1379 search results - page 27 / 276
» The Complexity of the Annihilating Polynomial
Sort
View
DISOPT
2007
93views more  DISOPT 2007»
14 years 10 months ago
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
Jacek Blazewicz, Piotr Formanowicz, Marta Kasprzak...
CORR
2010
Springer
138views Education» more  CORR 2010»
14 years 10 months ago
Shallow Circuits with High-Powered Inputs
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
Pascal Koiran
ECCC
2007
90views more  ECCC 2007»
14 years 10 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
CDC
2010
IEEE
118views Control Systems» more  CDC 2010»
14 years 5 months ago
Explicit solutions for root optimization of a polynomial family
Abstract-- Given a family of real or complex monic polynomials of fixed degree with one fixed affine constraint on their coefficients, consider the problem of minimizing the root r...
Vincent D. Blondel, Mert Gurbuzbalaban, Alexandre ...
ISCAS
2007
IEEE
90views Hardware» more  ISCAS 2007»
15 years 4 months ago
Synthesis of Wideband Linear-Phase FIR Filters with a Piecewise-Polynomial-Sinusoidal Impulse Response
— A method is presented to synthesize wideband linear-phase FIR filters with a piecewise-polynomial-sinusoidal impulse response. The proposed method is based on merging the earl...
Raija Lehto, Tapio Saramäki, Olli Vainio