Pages that link to "Item:Q5504705"

The following pages link to Partial Polymorphisms and Constraint Satisfaction Problems (Q5504705):

Displaying 22 items.

• Gap theorems for robust satisfiability: Boolean CSPs and beyond (Q527405) (← links)
• Trichotomies in the complexity of minimal inference (Q692908) (← links)
• Structure identification of Boolean relations and plain bases for co-clones (Q955340) (← links)
• The complexity of problems for quantified constraints (Q1959381) (← links)
• Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (Q2221799) (← links)
• The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
• Minimal distance of propositional models (Q2322705) (← links)
• The number of clones determined by disjunctions of unary relations (Q2322711) (← links)
• Weak bases of Boolean co-clones (Q2448853) (← links)
• General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
• As Close as It Gets (Q2803825) (← links)
• Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
• Complexity Classifications for Logic-Based Argumentation (Q2946726) (← links)
• Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight (Q3007678) (← links)
• Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
• (Q4553280) (← links)
• (Q5092397) (← links)
• Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)
• A Dichotomy Theorem for the Inverse Satisfiability Problem (Q5136331) (← links)
• Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
• (Q5863854) (← links)
• The algebraic structure of the densification and the sparsification tasks for CSPs (Q6080503) (← links)