Algorithmic and Computational Complexity Issues of MONET

@inproceedings{Hagen2008AlgorithmicAC,
  title={Algorithmic and Computational Complexity Issues of MONET},
  author={Matthias Hagen},
  year={2008}
}
In this thesis, we study the problem Monet—the Mo(notone) n(ormal form) e(quivalence) t(est)—that asks to decide equivalence of a monotone disjunctive normal form φ and a monotone conjunctive normal form ψ. This problem is a covering problem that can be interpreted as the task of enumerating all (in some sense) minimal solutions of some system. Hence, there is a huge number of similar questions in many problems from diverse applications. Our results can roughly be divided into results on the… CONTINUE READING
18 Citations
258 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 18 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 258 references

Similar Papers

Loading similar papers…