4 search results - page 1 / 1 » Complexity of DNF minimization and isomorphism testing for m... |
IANDC
2008
13 years 5 months ago
2008
MFCS
2005
Springer
13 years 11 months ago
2005
Springer
We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DN...
RANDOM
2001
Springer
13 years 10 months ago
2001
Springer
We consider the problem of determining whether a given function ¢ £ ¤¥ ¦ §¨© ¤¥ ¦ §¨ belongs to a certain class of Boolean functions or whether it is far from the...
IPL
2007
13 years 5 months ago
2007
We consider the problem Monet—given two monotone formulas ϕ in DNF and ψ in CNF, decide whether they are equivalent. While Monet is probably not coNPhard, it is a long standin...