10608 search results - page 558 / 2122 » Complexity of O'Hara's Algorithm |
194
click to vote
WIA
2009
Springer
16 years 1 months ago
2009
Springer
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential le...
171
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...
143
click to vote
COMPGEOM
2006
ACM
16 years 1 months ago
2006
ACM
The overlay of 2 ≤ m ≤ d minimization diagrams of n surfaces in Rd is isomorphic to a substructure of a suitably constructed minimization diagram of mn surfaces in Rd+m−1 . ...
199
click to vote
SOFSEM
2005
Springer
16 years 17 days ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
180
click to vote
TACAS
1997
Springer
15 years 11 months ago
1997
Springer
We present a highly polymorphic tool for the construction, synthesis, structuring, manipulation, investigation, and (symbolic) execution of graphs. The exibility of this tool, whic...