4378 search results - page 181 / 876 » On the Complexity of Ordered Colourings |
148
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We describe our progress building the program ReductionFinder, which uses off-the-shelf SAT solvers together with the Cmodels system to automatically search for reduction...
113
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We give a new, and hopefully more easily understandable, structural proof of the decomposition of a k-valued transducer into k unambiguous functional ones, a result established by...
131
click to vote
ENTCS
2010
15 years 6 months ago
2010
The global states of complex systems often form pospaces, topological spaces equipped with compatible partial orders reflecting causal relationships between the states. The calcul...
139
click to vote
JOT
2006
15 years 6 months ago
2006
As the size and complexity of software has rapidly grown during the past two decades, it has become a big challenge to assure quality of software and to curb the cost of developin...
140
click to vote
PR
2000
15 years 6 months ago
2000
The problem of the independence and completeness of rotation moment invariants is addressed in this paper. First, a general method for constructing invariants of arbitrary orders ...