39 search results - page 8 / 8 » On the enumeration of d-minimal permutations |
SARA
2009
Springer
14 years 9 days ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
FM
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. Predictive analysis aims at detecting concurrency errors during runtime by monitoring a concrete execution trace of a concurrent program. In recent years, various models ...
ISAAC
2004
Springer
13 years 11 months ago
2004
Springer
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...