The following pages link to (Q3321475):
Displaying 10 items.
- Steiner transitive-closure spanners of low-dimensional posets (Q397071) (← links)
- Lower bounds for constant-depth circuits in the presence of help bits (Q917289) (← links)
- Unbounded fan-in circuits and associative functions (Q1083202) (← links)
- Randomized range-maxima in nearly-constant parallel time (Q1210333) (← links)
- The complexity of parallel prefix problems on small domains (Q1373137) (← links)
- Constructing \(H\)4, a fast depth-size optimal parallel prefix circuit (Q1402306) (← links)
- Steiner Transitive-Closure Spanners of Low-Dimensional Posets (Q3012848) (← links)
- ON THE HARDNESS AGAINST CONSTANT-DEPTH LINEAR-SIZE CIRCUITS (Q3084685) (← links)
- Circuit complexity of regular languages (Q5895106) (← links)
- Prefix graphs and their applications (Q6184370) (← links)