484 search results - page 12 / 97 » Computing Hilbert Class Polynomials |
IWOCA
2010
Springer
13 years 2 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...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
We show several unconditional lower bounds for exponential time classes against polynomial time classes with advice, including:
COCO
2005
Springer
14 years 1 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...
DLT
2010
13 years 9 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
12 years 11 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...