484 search results - page 34 / 97 » Computing Hilbert Class Polynomials |
STACS
1997
Springer
13 years 11 months ago
1997
Springer
In this paper we present a new notion of what it means for a problem in P to be inherently sequential. Informally, a problem L is strictly sequential P-complete if when the best kn...
TCBB
2010
13 years 6 months ago
2010
—Phylogenetic networks are leaf-labeled, rooted, acyclic, directed graphs, that are used to model reticulate evolutionary histories. Several measures for quantifying the topologi...
ENTCS
2007
13 years 7 months ago
2007
Much of the literature on symmetry reductions for model checking assumes a simple model of computation where the local state of each component in a concurrent system can be repres...
ECCC
1998
13 years 7 months ago
1998
We consider the existence of pairs of probability ensembles which may be efficiently distinguished from each other given k samples but cannot be efficiently distinguished given ...
COMGEO
2010
ACM
13 years 7 months ago
2010
ACM
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...