1998 search results - page 166 / 400 » Complexity of the Cover Polynomial |
176
click to vote
ISSAC
2007
Springer
16 years 19 days ago
2007
Springer
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
159
click to vote
TLCA
2007
Springer
16 years 18 days 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...
159
click to vote
ICCV
2005
IEEE
16 years 3 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...
187
click to vote
LICS
2005
IEEE
16 years 2 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...
170
click to vote
CSCLP
2005
Springer
15 years 12 months 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 ...