484 search results - page 12 / 97 » Computing Hilbert Class Polynomials |
113
click to vote
IWOCA
2010
Springer
14 years 6 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
101
click to vote
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
120
Voted
COCO
2005
Springer
15 years 5 months ago
2005
Springer
We examine classes of distributional problems defined in terms of polynomial-time decision algorithms with bounded error probability. The class AvgP [5] has been characterized in...
96
Voted
DLT
2010
15 years 1 months ago
2010
Abstract. We prove that uniform and semi-uniform families of P systems with active membranes using only communication and nonelementary division rules are not computationally unive...
CORR
2011
Springer
14 years 3 months ago
2011
Springer
We propose a method and algorithm for computing the weighted MoorePenrose inverse of one-variable rational matrices. Also, we develop an algorithm for computing the weighted Moore...