Pages that link to "Item:Q5741801"
From MaRDI portal
The following pages link to Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis (Q5741801):
Displaying 17 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Strong partial clones and the time complexity of SAT problems (Q340559) (← 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)
- Some structural properties of SAT (Q1587336) (← links)
- Parameterized algorithms for recognizing monopolar and 2-subcolorable graphs (Q1678166) (← links)
- Sparsification and subexponential approximation (Q1702300) (← links)
- The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- Weak bases of Boolean co-clones (Q2448853) (← links)
- Nondeterministic extensions of the strong exponential time hypothesis and consequences for non-reducibility (Q2800573) (← 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)
- Polynomial-time functions generate SAT: On P-splinters (Q3975148) (← links)
- A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT (Q4608627) (← links)
- On Existential MSO and Its Relation to ETH (Q5862284) (← links)
- On the complexity of \(k\)-SAT (Q5943094) (← links)
