The following pages link to (Q2762521):
Displaying 17 items.
- The complexity of circumscriptive inference in Post's lattice (Q692903) (← links)
- Optimal satisfiability for propositional calculi and constraint satisfaction problems. (Q1426002) (← links)
- Optimizing with minimum satisfiability (Q1761303) (← links)
- The complexity of homomorphisms and renamings for minimal unsatisfiable formulas (Q1777396) (← links)
- The complexity of minimal satisfiability problems (Q1887137) (← links)
- Minimal inference problem over finite domains: the landscape of complexity (Q2401929) (← links)
- On the complexity of semantic self-minimization (Q2810966) (← links)
- (Q3783561) (← links)
- A Complexity Index for Satisfiability Problems (Q4286227) (← links)
- (Q4443550) (← links)
- The Complexity of the<i>A B C</i>Problem (Q4507329) (← links)
- (Q4941907) (← links)
- On the hardness of approximating the minimum consistent OBDD problem (Q5054808) (← links)
- Dörfler marking with minimal cardinality is a linear complexity problem (Q5118851) (← links)
- Parameterized and Exact Computation (Q5311504) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492848) (← links)
- Reasoning on property graphs with graph generating dependencies (Q6554875) (← links)