Pages that link to "Item:Q5957724"
From MaRDI portal
The following pages link to Reducing the complexity of reductions (Q5957724):
Displaying 12 items.
- DNF sparsification and a faster deterministic counting algorithm (Q354649) (← links)
- Local restrictions from the Furst-Saxe-Sipser paper (Q519884) (← links)
- The isomorphism conjecture for constant depth reductions (Q619896) (← links)
- Comparing reductions to NP-complete sets (Q879596) (← links)
- Local reduction (Q1641001) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Investigations Concerning the Structure of Complete Sets (Q2821693) (← links)
- The Complexity of Complexity (Q2973719) (← links)
- Local Reductions (Q3448833) (← links)
- (Q5077146) (← links)
- Strong Reductions and Isomorphism of Complete Sets (Q5458832) (← links)
- (Q5875501) (← links)
