1383 search results - page 126 / 277 » On the Complexity of the Interlace Polynomial |
171
click to vote
TLCA
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Predicative analysis of recursion schema is a method to characterize complexity classes like the class of polynomial time functions. This analysis comes from the works of...
172
click to vote
ICCV
2005
IEEE
16 years 20 days ago
2005
IEEE
We present a solution for optimal triangulation in three views. The solution is guaranteed to find the optimal solution because it computes all the stationary points of the (maxi...
206
click to vote
LICS
2005
IEEE
16 years 19 days ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
190
click to vote
CSCLP
2005
Springer
16 years 15 days ago
2005
Springer
Abstract. Among, Common and Disjoint are global constraints useful in modelling problems involving resources. We study a number of variations of these constraints over integer and ...
173
click to vote
SAT
2004
Springer
16 years 12 days ago
2004
Springer
We study the parameterized complexity of detecting backdoor sets for instances of the propositional satisfiability problem (SAT) with respect to the polynomially solvable classes ...