2430 search results - page 25 / 486 » Computing Tutte Polynomials |
MOC
2011
13 years 2 months ago
2011
DCC
1999
IEEE
13 years 7 months ago
1999
IEEE
An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve...
ALGORITHMICA
2011
13 years 2 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
MCU
2007
13 years 9 months ago
2007
We review some results about the computational power of several computational models. Considered models have in common to be related to continuous dynamical systems. 1 Dynamical Sy...
CAGD
2006
13 years 7 months ago
2006
We describe how some simple properties of discrete one-forms directly relate to some old and new results concerning the parameterization of 3D mesh data. Our first result is an ea...