Pages that link to "Item:Q1768604"
From MaRDI portal
The following pages link to On approximability of Boolean formula minimization (Q1768604):
Displaying 7 items.
- Approximability of minimum AND-circuits (Q1024782) (← links)
- Boolean query optimization and the 0-1 hyperbolic sum problem (Q1356211) (← links)
- Minimum \(\varepsilon\)-equivalent circuit size problem (Q1777423) (← links)
- Computing smallest MUSes of quantified Boolean formulas (Q2694579) (← links)
- Fixed-parameter Approximability of Boolean MinCSPs (Q4606287) (← links)
- (Q5092482) (← links)
- Boolean Minimization of Projected Sums of Products via Boolean Relations (Q5229021) (← links)