1998 search results - page 132 / 400 » Complexity of the Cover Polynomial |
219
click to vote
LICS
2000
IEEE
15 years 10 months ago
2000
IEEE
We prove that several problems concerning congruences on algebras are complete for nondeterministic log-space. These problems are: determining the congruence on a given algebra gen...
180
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. Protein-protein interactions (PPIs) are one of the most important mechanisms in cellular processes. To model protein interaction sites, recent studies have suggested to f...
184
click to vote
STOC
2010
ACM
16 years 3 months ago
2010
ACM
We present a generic method for converting any family of unsatisfiable CNF formulas that require large resolution rank into CNF formulas whose refutation requires large rank for p...
172
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
196
click to vote
ICRA
2010
IEEE
15 years 3 months ago
2010
IEEE
This paper is about the automated discovery and mapping of surfaces using a stereo pair. We begin with the observation that for any workspace which is topologically connected (i.e....