The following pages link to STACS 2004 (Q5309697):
Displaying 10 items.
- On the expression complexity of equivalence and isomorphism of primitive positive formulas (Q692919) (← links)
- Bases for Boolean co-clones (Q1044708) (← links)
- Isomorphic implication (Q2272203) (← links)
- On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
- The complexity of equivalence and isomorphism of systems of equations over finite groups (Q2575758) (← links)
- Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits (Q2890182) (← links)
- Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint (Q3540174) (← links)
- (Q4411838) (← links)
- Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? (Q5504698) (← links)
- An Isomorphism-Invariant Distance Function on Propositional Formulas in CNF (Q6113549) (← links)
