2430 search results - page 9 / 486 » Computing Tutte Polynomials |
109
Voted
RTA
2010
Springer
15 years 5 days ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and...
128
Voted
CMA
2010
14 years 10 months ago
2010
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
87
Voted
MOC
2002
15 years 1 months ago
2002
We answer a question left open in an article of Coppersmith and Davenport which proved the existence of polynomials whose powers are sparse, and in particular polynomials whose squ...
97
Voted
CADE
1992
Springer
15 years 5 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
126
Voted
STACS
2009
Springer
15 years 6 months ago
2009
Springer
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...