The following pages link to Brian S. Leininger (Q1162149):
Displayed 8 items.
- On the complexity of simple arithmetic expressions (Q1162150) (← links)
- On the zero-inequivalence problem for loop programs (Q1171383) (← links)
- A note on the complexity of program evaluation (Q3319774) (← links)
- On the Simplification and Equivalence Problems for Straight-Line Programs (Q3763569) (← links)
- (Q3912020) (← links)
- Characterizations of Presburger Functions (Q3926041) (← links)
- The Complexity of the Equivalence Problem for Simple Loop-Free Programs (Q3939215) (← links)
- Straight-Line Programs with One Input Variable (Q3947097) (← links)