Pages that link to "Item:Q3521905"
From MaRDI portal
The following pages link to The Complexity of Boolean Formula Minimization (Q3521905):
Displaying 16 items.
- Fast simplifications for Tarski formulas based on monomial inequalities (Q420752) (← links)
- Random arithmetic formulas can be reconstructed efficiently (Q488050) (← links)
- The complexity of Boolean formula minimization (Q619911) (← links)
- The complexity of variable minimal formulas (Q708020) (← links)
- Computational complexity of quantified Boolean formulas with fixed maximal deficiency (Q955019) (← links)
- On minimizing the \(\forall\)-\(\neg\) degree of a connective-free formula (Q1323356) (← links)
- The minimum equivalent DNF problem and shortest implicants (Q1604210) (← 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)
- CIRCUIT INTEGRATION THROUGH LATTICE HYPERTERMS (Q3007769) (← links)
- (Q3197771) (← links)
- Optimizing S-Box Implementations for Several Criteria Using SAT Solvers (Q4639475) (← links)
- (Q5092482) (← links)
- Minimal False Quantified Boolean Formulas (Q5756555) (← links)
- Arithmetic Expression Construction. (Q6065408) (← links)