Pages that link to "Item:Q5492876"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2005 (Q5492876):
Displaying 8 items.
- Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444) (← links)
- On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
- DP-Complete Problems Derived from Extremal NP-Complete Properties (Q3182925) (← links)
- (Q3783561) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- On the Complexity of the Multiplication Method for Monotone CNF/DNF Dualization (Q5449540) (← links)
- Discovery Science (Q5464546) (← links)
- An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF (Q6113549) (← links)