Pages that link to "Item:Q1276160"
From MaRDI portal
The following pages link to Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160):
Displaying 17 items.
- 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)
- Reductions to graph isomorphism (Q987394) (← links)
- For completeness, sublogarithmic space is no space. (Q1853022) (← links)
- Equivalence of NC\(^ k\) and AC\(^{k-1}\) closures of NP and other classes (Q1898478) (← links)
- Cryptographic hardness under projections for time-bounded Kolmogorov complexity (Q2699976) (← links)
- Investigations Concerning the Structure of Complete Sets (Q2821693) (← links)
- Nonuniform reductions and NP-completeness (Q3304139) (← links)
- (Q4218116) (← links)
- (Q4638077) (← links)
- New insights on the (non-)hardness of circuit minimization and related problems (Q5111269) (← links)
- Reductions to Graph Isomorphism (Q5458831) (← links)
- Strong Reductions and Isomorphism of Complete Sets (Q5458832) (← links)
- The non-hardness of approximating circuit size (Q5918358) (← links)
- A lower bound for primality (Q5943093) (← links)
- Reducing the complexity of reductions (Q5957724) (← links)