Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

IANDC
2008

favoriteEmaildiscussreport

81views more IANDC 2008»

Complexity of DNF minimization and isomorphism testing for monotone formulas

13 years 4 months ago

Complexity of DNF minimization and isomorphism testing for monotone formulas

Download www.uni-weimar.de

Judy Goldsmith, Matthias Hagen, Martin Mundhenk

Real-time Traffic

IANDC 2008 |

claim paper

Related Content

» Complexity of DNF and Isomorphism of Monotone Formulas

» Proclaiming Dictators and Juntas or Testing Boolean Formulae

» On the fixedparameter tractability of the equivalence test of monotone normal forms

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	IANDC
Authors	Judy Goldsmith, Matthias Hagen, Martin Mundhenk

Comments (0)