Pages that link to "Item:Q939444"
From MaRDI portal
The following pages link to Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444):
Displaying 9 items.
- The minimum equivalent DNF problem and shortest implicants (Q1604210) (← links)
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Complexity results for probabilistic answer set programming (Q2302961) (← links)
- On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
- Isomorphism testing of read-once functions and polynomials (Q2672283) (← links)
- On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization (Q5449540) (← links)
- Discovery Science (Q5464546) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492876) (← links)
- Towards an efficient implementation of a tableau method for reactive safety specifications (Q6643466) (← links)