The following pages link to (Q4527042):
Displaying 10 items.
- Reductions in circuit complexity: An isomorphism theorem and a gap theorem (Q1276160) (← links)
- A reduction algorithm meeting users' requirements. (Q1850684) (← links)
- For completeness, sublogarithmic space is no space. (Q1853022) (← links)
- Reductivity (Q1916366) (← links)
- Value-free reductions (Q2667278) (← links)
- Finding Reductions Automatically (Q3586003) (← links)
- (Q4218419) (← links)
- Lazy narrowing with simplification (Q4395684) (← links)
- A lower bound for primality (Q5943093) (← links)
- The descriptive complexity approach to LOGCFL (Q5946058) (← links)