2430 search results - page 221 / 486 » Computing Tutte Polynomials |
120
click to vote
ESA
2004
Springer
15 years 9 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
135
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
196
click to vote
ICPR
2000
IEEE
15 years 8 months ago
2000
IEEE
A new concept and algorithm are presented for noniterative robust estimation of piecewise smooth curves of maximal edge strength in small image windows – typically ¢¡£ to...
149
click to vote
CIAC
1997
Springer
15 years 8 months ago
1997
Springer
In this paper, we study the Graph Isomorphism problem on graphs of bounded treewidth, bounded degree or bounded bandwidth. Graph Isomorphism can be solved in polynomial time for g...
209
click to vote
ISSAC
1997
Springer
15 years 8 months ago
1997
Springer
Gaussian elimination is the basis for classical algorithms for computing canonical forms of integer matrices. Experimental results have shown that integer Gaussian elimination may...