Searching for "The Minimization Problem for Boolean Formulas." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP ∗
by Dorothea Baumeister, Felix Fischer, Felix Brandt, Jörg Rothe — 2009
…]). Hemaspaandra and Wechsung [HW02] proved that the minimization problem for boolean formulas is Θ p 2-hard…
Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB