The following pages link to Rudimentary reductions revisited (Q1183444):
Displaying 15 items.
- Repetition in reduced decompositions (Q432487) (← links)
- The isomorphism conjecture for constant depth reductions (Q619896) (← links)
- On adaptive DLOGTIME and POLYLOGTIME reductions (Q672322) (← links)
- A constant-space sequential model of computation for first-order logic (Q1271562) (← links)
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- The complexity of computing maximal word functions (Q1321032) (← links)
- Reductions and functors from problems to word problems (Q1566706) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- The minimum oracle circuit size problem (Q2410683) (← links)
- Investigations Concerning the Structure of Complete Sets (Q2821693) (← links)
- The Reduceron reconfigured and re-evaluated (Q3165526) (← links)
- Negative Results on the Reduction of the Recursion Scheme (Q3803098) (← links)
- Fifty years of the spectrum problem: survey and new results (Q4902770) (← links)
- Analog reducibility (Q5163980) (← links)
- Circuit complexity before the dawn of the new millennium (Q6567750) (← links)
