Search Sciweavers | Sciweavers

1379 search results - page 13 / 276

» The Complexity of the Annihilating Polynomial

click to vote

LICS
2008
IEEE

116views Automated Reasoning» more LICS 2008»

On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity

15 years 4 months ago

Download www.eecs.qmul.ac.uk

We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...

Søren Riis

claim paper

Read More »

click to vote

TSP
2008

74views more TSP 2008»

Performance of ESPRIT for Estimating Mixtures of Complex Exponentials Modulated by Polynomials

14 years 9 months ago

Download www.tsi.enst.fr

High Resolution (HR) methods are known to provide accurate frequency estimates for discrete spectra. The Polynomial Amplitude Complex Exponentials (PACE) model, also called quasipo...

Roland Badeau, Gaël Richard, Bertrand David

claim paper

Read More »

click to vote

IJAC
2007

59views more IJAC 2007»

Polynomial-Time Complexity for Instances of the Endomorphism Problem in Free Groups

14 years 9 months ago

Download www.crm.es

Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided eﬀectively whether, given U in F , there is an endomorphism φ of F ...

Laura Ciobanu

claim paper

Read More »

click to vote

CSR
2009
Springer

96views Theoretical Computer Science» more CSR 2009»

Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials

15 years 4 months ago