2430 search results - page 156 / 486 » Computing Tutte Polynomials |
144
click to vote
CHES
2005
Springer
15 years 10 months ago
2005
Springer
The Truncated Multiplication computes a truncated product, a contiguous subsequence of the digits of the product of 2 integers. A few truncated polynomial multiplication algorithms...
152
click to vote
FSTTCS
2005
Springer
15 years 10 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
171
click to vote
ICALP
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We present an expected polynomial time algorithm to generate a labeled planar graph uniformly at random. To generate the planar graphs, we derive recurrence formulas that...
140
click to vote
CHES
2000
Springer
15 years 9 months ago
2000
Springer
Abstract. We describe an implementation of the PASS polynomial authentication and signature scheme [5, 6] that is suitable for use in highly constrained environments such as SmartC...
156
click to vote
CPM
2008
Springer
15 years 6 months ago
2008
Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...