1383 search results - page 166 / 277 » On the Complexity of the Interlace Polynomial |
154
click to vote
DLT
2003
15 years 7 months ago
2003
We present different techniques for reducing the number of states and transitions in nondeterministic automata. These techniques are based on the two preorders over the set of st...
127
click to vote
NIPS
2003
15 years 7 months ago
2003
The 2-class transduction problem, as formulated by Vapnik [1], involves finding a separating hyperplane for a labelled data set that is also maximally distant from a given set of...
166
click to vote
CGA
1998
15 years 6 months ago
1998
This paper describes methods and data structures used to leverage motion sequences of complex linked figures. We present a technique for interpolating between example motions der...
168
click to vote
JUCS
2010
15 years 4 months ago
2010
: Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that the...
181
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...