Sciweavers

27 search results - page 6 / 6
» Normal forms for general polynomial matrices
Sort
View
ICDT
2010
ACM
141views Database» more  ICDT 2010»
13 years 10 months ago
The Complexity of Rooted Phylogeny problems
Several computational problems in phylogenetic reconstruction can be formulated as restrictions of the following general problem: given a formula in conjunctive normal form where ...
Manuel Bodirsky, Jens K. Mueller
CIE
2007
Springer
14 years 6 days ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer