2430 search results - page 41 / 486 » Computing Tutte Polynomials |
GD
2008
Springer
13 years 11 months ago
2008
Springer
CMA
2011
13 years 5 months ago
2011
ACMSE
2006
ACM
14 years 1 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
JSC
2006
13 years 10 months ago
2006
For a polynomial ring R = k[x1, ..., xn], we present a method to compute the characteristic cycle of the localization Rf for any nonzero polynomial f R that avoids a direct comput...
NSF
1994
Springer
14 years 2 months ago
1994
Springer
The goal of algebraic geometry is to gain an understanding of the behaviour of functions related by polynomial relationships. Algebraic curves and surfaces having considerable adva...