Pages that link to "Item:Q1581496"
From MaRDI portal
The following pages link to The computational complexity of equivalence and isomorphism problems (Q1581496):
Displaying 12 items.
- Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
- Complexity classes of equivalence problems revisited (Q716333) (← links)
- On the complexity of polytope isomorphism problems (Q1401558) (← links)
- On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
- The isomorphism conjecture for NP (Q2906562) (← links)
- On the Complexity of Matroid Isomorphism Problems (Q3392964) (← links)
- (Q3633739) (← links)
- (Q3796984) (← links)
- (Q4247795) (← links)
- (Q4259991) (← links)
- Measuring the complexity of reductions between equivalence relations (Q5211066) (← links)
- The Complexity of Order Type Isomorphism (Q5383989) (← links)