Complexity of DNF minimization and isomorphism testing for monotone formulas-Reference-Cited by-同舟云学术

Complexity of DNF minimization and isomorphism testing for monotone formulas

Published:2008-06 Issue:6 Volume:206 Page:760-775
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Goldsmith Judy,Hagen Matthias,Mundhenk Martin

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference21 articles.

1. The formula isomorphism problem;Agrawal;SIAM Journal on Computing,2000

2. An efficient incremental algorithm for generating all maximal independent sets in hypergraphs of bounded dimension;Boros;Parallel Processing Letters,2000

3. On the computational complexity of some classical equivalence relations on Boolean functions;Borchert;Theory of Computing Systems,1998

4. Sebastian Lukas Arne Czort, The complexity of minimizing disjunctive normal formulas, Technical Report IR-130, University of Aarhus, Department of Computer Science, January 1999.

5. Identifying the minimal transversals of a hypergraph and related problems;Eiter;SIAM Journal on Computing,1995

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards an efficient implementation of a tableau method for reactive safety specifications;Journal of Logical and Algebraic Methods in Programming;2025-01

2. Minimally Factorizing the Provenance of Self-join Free Conjunctive Queries;Proceedings of the ACM on Management of Data;2024-05-10

3. Isomorphism testing of read-once functions and polynomials;Information and Computation;2022-05

4. MAJORITY-3SAT (and Related Problems) in Polynomial Time;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

5. Complexity results for probabilistic answer set programming;International Journal of Approximate Reasoning;2020-03