Pages that link to "Item:Q619911"
From MaRDI portal
The following pages link to The complexity of Boolean formula minimization (Q619911):
Displaying 9 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)
- On compiling Boolean circuits optimized for secure multi-party computation (Q1696583) (← links)
- (Q5092482) (← 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)
