Nondeterministic space is closed under complementation
SIAM Journal on Computing
On the complexity of H-coloring
Journal of Combinatorial Theory Series B
Capturing complexity classes by fragments of second-order logic
Theoretical Computer Science - Special issue on logic and applications to computer science
Fast parallel constraint satisfaction
Artificial Intelligence
Lower bounds on type inference with subtypes
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Satisfiability of inequalities in a poset
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
Algebraic properties and dismantlability of finite posets
Discrete Mathematics
Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
Some complexity bounds for subtype inequalities
Theoretical Computer Science - Special issue: Gentzen
Scheduling series-parallel orders subject to 0/1-communication delays
Parallel Computing - Special issue on task scheduling problems for parallel and distributed systems
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
A comparison of structural CSP decomposition methods
Artificial Intelligence
A compendium of problems complete for symmetric logarithmic space
Computational Complexity
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
The complexity of maximal constraint languages
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A Dichotomy Theorem for Constraints on a Three-Element Set
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Constraint Satisfaction Problems and Finite Algebras
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Constraint Satisfaction Problems in Non-deterministic Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Series-Parallel Posets: Algebra, Automata and Languages
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Closure Functions and Width 1 Problems
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A Unifying Framework for Tractable Constraints
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Constraints, consistency and closure
Artificial Intelligence
Majority constraints have bounded pathwidth duality
European Journal of Combinatorics
Near Unanimity Constraints Have Bounded Pathwidth Duality
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
We combine methods of order theory, finite model theory, and universal algebra to study, within the constraint satisfaction framework, the complexity of some well-known combinatorial problems connected with a finite poset. We identify some conditions on a poset which guarantee solvability of the problems in (deterministic, symmetric, or non-deterministic) logarithmic space. On the example of order constraints we study how a certain algebraic invariance property is related to solvability of a constraint satisfaction problem in nondeterministic logarithmic space.