Sciweavers

CSR
2008
Springer
15 years 7 days ago
A survey of constraint-based programming paradigms
Maria Grazia Buscemi, Ugo Montanari
106
Voted
CSR
2008
Springer
15 years 7 days ago
Colouring, constraint satisfaction, and complexity
Constraint satisfaction problems have enjoyed much attention since the early seventies, and in the last decade have become also a focus of attention amongst theoreticians. Graph c...
Pavol Hell, Jaroslav Nesetril
CSR
2008
Springer
15 years 7 days ago
A survey of state vectors
Ward Douglas Maurer
101
Voted
CSR
2008
Springer
15 years 7 days ago
Randomly colouring graphs (a combinatorial view)
Jean-Sébastien Sereni
CSR
2008
Springer
15 years 7 days ago
The consequences of eliminating NP solutions
Piotr Faliszewski, Lane A. Hemaspaandra
85
Voted
CSR
2008
Springer
15 years 7 days ago
The saga of minimum spanning trees
Martin Mares
CSR
2008
Springer
15 years 7 days ago
A Triple Correspondence in Canonical Calculi: Strong Cut-Elimination, Coherence, and Non-deterministic Semantics
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
Arnon Avron, Anna Zamansky