1169 search results - page 44 / 234 » Degrees of monotone complexity |
ISSAC
2005
Springer
14 years 2 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
ICCAD
1996
IEEE
14 years 28 days ago
1996
IEEE
The functional validation of a state-of-the-art digital design is usually performed by simulation of a register-transfer-level model. The degree to which the testvector suite cove...
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. Markov random fields are often used to model high dimensional distributions in a number of applied areas. A number of recent papers have studied the problem of reconstruc...
DAM
2008
13 years 8 months ago
2008
Given a graph G = (V, E) and a positive integer k, the PARTITION INTO CLIQUES (PIC) decision problem consists of deciding whether there exists a partition of V into k disjoint sub...
JC
2008
13 years 8 months ago
2008
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(log(nD(f))) iterations (grid refinements) where n is...