Sciweavers

CORR
2010
Springer
163views Education» more  CORR 2010»
13 years 9 months ago
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems
We show that unless P=NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a multivariate polynomial of degree four (or higher ev...
Amir Ali Ahmadi, Alexander Olshevsky, Pablo A. Par...
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 9 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
FOCM
2010
111views more  FOCM 2010»
13 years 9 months ago
A Note on the Finite Variance of the Averaging Function for Polynomial System Solving
In [BP08], the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, an...
Carlos Beltrán, Michael Shub
CORR
2010
Springer
179views Education» more  CORR 2010»
13 years 9 months ago
The DMM bound: multivariate (aggregate) separation bounds
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
ICIP
2009
IEEE
13 years 10 months ago
Efficient design of 2-D nonseparable filters of low complexity
By using Semi-Definite Programming (SDP) as a tool, a new deign for Two-Dimensional (2-D) Diamond-Shaped (DS) filters is developed. Surprisingly, the diamond shape of the filter is...
Kaveh Fanian, Hoang Duong Tuan, Truong Q. Nguyen
DLT
2009
13 years 10 months ago
On the Complexity of Deciding Avoidability of Sets of Partial Words
Blanchet-Sadri et al. have shown that Avoidability, or the problem of deciding the avoidability of a finite set of partial words over an alphabet of size k 2, is NP-hard [Theoret...
Brandon Blakeley, Francine Blanchet-Sadri, Josh Gu...
TCS
1998
14 years 2 days ago
Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete
The complexity of the reachability problem for live and safe free-choice Petri nets has been open for several years. Several partial results seemed to indicate that the problem is...
Javier Esparza
MOC
1998
107views more  MOC 1998»
14 years 3 days ago
Fast algorithms for discrete polynomial transforms
Consider the Vandermonde-like matrix P := (Pk(cos jπ N ))N j,k=0, where the polynomials Pk satisfy a three-term recurrence relation. If Pk are the Chebyshev polynomials Tk, then P...
Daniel Potts, Gabriele Steidl, Manfred Tasche
MOC
2002
149views more  MOC 2002»
14 years 3 days ago
Sparse squares of polynomials
We answer a question left open in an article of Coppersmith and Davenport which proved the existence of polynomials whose powers are sparse, and in particular polynomials whose squ...
John Abbott
JCT
2002
48views more  JCT 2002»
14 years 3 days ago
Forest Volume Decompositions and Abel - Cayley - Hurwitz Multinomial Expansions
This paper presents a systematic approach to the discovery, interpretation and veri cation of various extensions of Hurwitz's multinomial identities, involving polynomials de...
Jim Pitman