Pages that link to "Item:Q716333"
From MaRDI portal
The following pages link to Complexity classes of equivalence problems revisited (Q716333):
Displaying 13 items.
- On the computational complexity of some classical equivalence relations on boolean functions (Q1272598) (← links)
- Lower bounds for protrusion replacement by counting equivalence classes (Q2174552) (← links)
- Deciding equivalence of separated non-nested attribute systems in polynomial time (Q2289099) (← links)
- On the decidability of the PVD class with equality (Q2743641) (← links)
- On the complexity of stream equality (Q2875229) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
- Minimum Circuit Size, Graph Isomorphism, and Related Problems (Q3176189) (← links)
- (Q4385988) (← links)
- ITERATION OF INVERTIBLE TRANSDUCTIONS (Q5173290) (← links)
- Measuring the complexity of reductions between equivalence relations (Q5211066) (← links)
- Algorithms for Group Isomorphism via Group Extensions and Cohomology (Q5283241) (← links)
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness (Q5890037) (← links)
- Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071) (← links)