Sciweavers

5 search results - page 1 / 1
» Complexity of DNF and Isomorphism of Monotone Formulas
Sort
View
81
Voted
MFCS
2005
Springer
15 years 3 months ago
Complexity of DNF and Isomorphism of Monotone Formulas
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...
Judy Goldsmith, Matthias Hagen, Martin Mundhenk
55
Voted
IANDC
2008
81views more  IANDC 2008»
14 years 10 months ago
Complexity of DNF minimization and isomorphism testing for monotone formulas
Judy Goldsmith, Matthias Hagen, Martin Mundhenk
108
Voted
RANDOM
2001
Springer
15 years 2 months ago
Proclaiming Dictators and Juntas or Testing Boolean Formulae
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...
Michal Parnas, Dana Ron, Alex Samorodnitsky
75
Voted
IPL
2007
69views more  IPL 2007»
14 years 10 months ago
On the fixed-parameter tractability of the equivalence test of monotone normal forms
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...
Matthias Hagen
96
Voted
COLT
1993
Springer
15 years 2 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...