The following pages link to Weak bases of Boolean co-clones (Q2448853):
Displaying 11 items.
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- On the interval of strong partial clones of Boolean functions containing \(\mathrm{Pol}(\{(0, 0), (0, 1), (1, 0)\})\) (Q509534) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← 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)
- Weak bases of Boolean co-clones (Q2448853) (← links)
- As Close as It Gets (Q2803825) (← links)
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
- (Q5092397) (← links)
- A Dichotomy Theorem for the Inverse Satisfiability Problem (Q5136331) (← links)
