1998 search results - page 123 / 400 » Complexity of the Cover Polynomial |
149
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. The constraint satisfaction problem can be solved in polynomial time for instances where certain parameters (e.g., the treewidth of primal graphs) are bounded. However, t...
141
click to vote
COMPGEOM
1989
ACM
15 years 10 months ago
1989
ACM
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...
138
click to vote
DAGSTUHL
2010
15 years 7 months ago
2010
Applications of complex variables and related manifolds appear throughout mathematics and science. Here we review a family of basic methods for applying visualization concepts to ...
189
click to vote
GLOBECOM
2007
IEEE
16 years 23 days ago
2007
IEEE
— Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The comple...
188
click to vote
FCT
2005
Springer
15 years 12 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...