Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

MFCS
2010
Springer

favoriteEmaildiscussreport

139views Theoretical Computer Science» more MFCS 2010»

The Multivariate Resultant Is NP-hard in Any Characteristic

13 years 9 months ago

The Multivariate Resultant Is NP-hard in Any Characteristic

Download www.cs.toronto.edu

Bruno Grenet, Pascal Koiran, Natacha Portier

Real-time Traffic

MFCS 2010 | Theoretical Computer Science |

claim paper

Related Content

» Detecting Rational Points on Hypersurfaces over Finite Fields

» Fault tolerant target tracking in sensor networks

» A robust measure of correlation between two genes on a microarray

» Orthogonal projections to latent structures as a strategy for microarray data normalizatio...

» Call Availability Prediction in a Telecommunication System A Data Driven Empirical Approac...

» Fundamental limit of discretetime systems in tracking multitone sinusoidal signals

Post Info
More Details (n/a)

Added	29 Jan 2011
Updated	29 Jan 2011
Type	Journal
Year	2010
Where	MFCS
Authors	Bruno Grenet, Pascal Koiran, Natacha Portier

Comments (0)