Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Introduction to the Theory of Computation
Introduction to the Theory of Computation
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Set Partitioning via Inclusion-Exclusion
SIAM Journal on Computing
A space-time tradeoff for permutation problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Determinant Sums for Undirected Hamiltonicity
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Scheduling partially ordered jobs faster than 2n
ESA'11 Proceedings of the 19th European conference on Algorithms
Slightly superexponential parameterized problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
Theory of Computing Systems
| Hi-index | 5.23 |
In the Permutation Constraint Satisfaction Problem (Permutation CSP) we are given a set of variables V and a set of constraints C, in which the constraints are tuples of elements of V. The goal is to find a total ordering of the variables, @p:V-[1,...,|V|], which satisfies as many constraints as possible. A constraint (v"1,v"2,...,v"k) is satisfied by an ordering @p when @p(v"1)