Pages that link to "Item:Q5741801"

The following pages link to Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis (Q5741801):

Displaying 8 items.

• Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
• Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223) (← links)
• An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
• Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
• Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
• Weak bases of Boolean co-clones (Q2448853) (← links)
• Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
• Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem (Q2946352) (← links)