Sciweavers

2430 search results - page 86 / 486
» Computing Tutte Polynomials
Sort
View
151
Voted
ACMSE
2006
ACM
15 years 6 months ago
Achieving efficient polynomial multiplication in fermat fields using the fast Fourier transform
We introduce an efficient way of performing polynomial multiplication in a class of finite fields GF(pm ) in the frequency domain. The Fast Fourier Transform (FFT) based frequency...
Selçuk Baktir, Berk Sunar
112
Voted
ICIP
1995
IEEE
16 years 4 months ago
Constrained monotone regression of ROC curves and histograms using splines and polynomials
Receiver operating characteristics (ROC) curves have the property that they start at (0,l) and end at (1,O) and are monotonically decreasing. Furthermore, a parametric representat...
Tapas Kanungo, D. M. Gay, Robert M. Haralick
150
Voted
FOCS
1999
IEEE
15 years 7 months ago
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
Maria Luisa Bonet, Nicola Galesi
126
Voted
CORR
2008
Springer
143views Education» more  CORR 2008»
15 years 2 months ago
Convergence Thresholds of Newton's Method for Monotone Polynomial Equations
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
97
Voted
CORR
2010
Springer
159views Education» more  CORR 2010»
15 years 2 months ago
An Elimination Method for Solving Bivariate Polynomial Systems: Eliminating the Usual Drawbacks
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination metho...
Eric Berberich, Pavel Emeliyanenko, Michael Sagral...