The following pages link to Stephen J. Bellantoni (Q757037):
Displayed 14 items.
- (Q685649) (redirect page) (← links)
- Grid intersection graphs and boxicity (Q685652) (← links)
- Parallel random access machines with bounded memory wordsize (Q757038) (← links)
- (Q1207332) (redirect page) (← links)
- A new recursion-theoretic characterization of the polytime functions (Q1207333) (← links)
- Higher type recursion, ramification and polynomial time (Q1577477) (← links)
- Separating NC along the \(\delta\) axis (Q1827390) (← links)
- Approximation and Small-Depth Frege Proofs (Q4027856) (← links)
- Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited (Q4268889) (← links)
- (Q4375785) (← links)
- A new “feasible” arithmetic (Q4532603) (← links)
- (Q4823143) (← links)
- (Q4850544) (← links)
- Characterizing parallel time by type 2 recursions with polynomial output length (Q6064285) (← links)