Pages that link to "Item:Q619911"
From MaRDI portal
The following pages link to The complexity of Boolean formula minimization (Q619911):
Displaying 19 items.
- A decomposition method for CNF minimality proofs (Q392185) (← links)
- On the applicability of Post's lattice (Q436335) (← links)
- Algorithms for computing minimal equivalent subformulas (Q460638) (← links)
- Computational complexity of quantified Boolean formulas with fixed maximal deficiency (Q955019) (← links)
- The minimum equivalent DNF problem and shortest implicants (Q1604210) (← links)
- On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
- On approximability of Boolean formula minimization (Q1768604) (← links)
- On the minimization of complexity and automation of efficient representation of Boolean functions in classes of formulas and circuits (Q2263837) (← links)
- Primitivity, uniform minimality, and state complexity of Boolean operations (Q2322701) (← links)
- Computing smallest MUSes of quantified Boolean formulas (Q2694579) (← links)
- (Q3197771) (← links)
- The Complexity of Boolean Formula Minimization (Q3521905) (← links)
- Fixed-parameter Approximability of Boolean MinCSPs (Q4606287) (← links)
- (Q5092482) (← links)
- Minimal False Quantified Boolean Formulas (Q5756555) (← links)
- Approximating Minimum Representations of Key Horn Functions (Q5863327) (← links)
- The ghosts of forgotten things: a study on size after forgetting (Q6560989) (← links)
- Constant depth formula and partial function versions of MCSP are hard (Q6654556) (← links)
- Common equivalence and size of forgetting from Horn formulae (Q6661056) (← links)