Pages that link to "Item:Q340559"
From MaRDI portal
The following pages link to Strong partial clones and the time complexity of SAT problems (Q340559):
Displaying 13 items.
- CNF satisfiability in a subspace and related problems (Q2093572) (← 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)
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- (Q5005145) (← links)
- Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
- Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)
- A Dichotomy Theorem for the Inverse Satisfiability Problem (Q5136331) (← links)
- (Q5863854) (← links)
- A note on clustering aggregation for binary clusterings (Q6556150) (← links)
- Algebraic global gadgetry for surjective constraint satisfaction (Q6581872) (← links)
- The complexity of the distributed constraint satisfaction problem (Q6614615) (← links)
