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 4 items.
- The complexity of Bayesian networks specified by propositional and relational languages (Q1711881) (← links)
- Complexity results for probabilistic answer set programming (Q2302961) (← links)
- Isomorphism testing of read-once functions and polynomials (Q2672283) (← links)
- Towards an efficient implementation of a tableau method for reactive safety specifications (Q6643466) (← links)
