9842 search results - page 51 / 1969 » Problem complexity |
CISSE
2009
Springer
14 years 1 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
BCS
2008
13 years 11 months ago
2008
Parity games underlie the model checking problem for the modal
DISOPT
2007
13 years 9 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We explore the intricate interdependent relationship among counting problems, considered from three frameworks for such problems: Holant Problems, counting CSP and weighted H-color...
CSR
2007
Springer
14 years 3 months ago
2007
Springer
We investigate the complexity of equivalence problems for {∪, ∩, − , +, ×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer an...