Pages that link to "Item:Q1272598"
From MaRDI portal
The following pages link to On the computational complexity of some classical equivalence relations on boolean functions (Q1272598):
Displaying 17 items.
- The complexity of game isomorphism (Q650900) (← links)
- On the \(\Delta \)-equivalence of Boolean functions (Q783100) (← links)
- Some results of Maria Serna on strategic games: complexity of equilibria and models (Q826318) (← links)
- Efficient computation of approximate isomorphisms between Boolean functions (Q903194) (← links)
- Complexity of DNF minimization and isomorphism testing for monotone formulas (Q939444) (← links)
- Computational isomorphisms in classical logic (Q1398471) (← links)
- The computational complexity of equivalence and isomorphism problems (Q1581496) (← links)
- The minimum equivalent DNF problem and shortest implicants (Q1604210) (← links)
- Computing the number of the equivalence classes for reversible logic functions (Q2197037) (← links)
- Isomorphic implication (Q2272203) (← links)
- Isomorphism testing of read-once functions and polynomials (Q2672283) (← links)
- On the computational complexity of finite operations (Q2806555) (← links)
- Hypergraph isomorphism and structural equivalence of Boolean functions (Q2819594) (← links)
- Restrictive Acceptance Suffices for Equivalence Problems (Q4504964) (← links)
- Boolean complexity classes vs. their arithmetic analogs (Q4894604) (← links)
- STACS 2004 (Q5309697) (← links)
- Theory and Applications of Satisfiability Testing (Q5713724) (← links)
