The following pages link to (Q4133967):
Displaying 10 items.
- The most nonelementary theory (Q598194) (← links)
- A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
- Compositional complexity of Boolean functions (Q1162360) (← links)
- A simple proof of a theorem of Statman (Q1199546) (← links)
- The typed lambda-calculus is not elementary recursive (Q1259590) (← links)
- On computational complexity of Prolog programs (Q1311967) (← links)
- The complexity of the word problems for commutative semigroups and polynomial ideals (Q1836661) (← links)
- Parallel beta reduction is not elementary recursive (Q1854460) (← links)
- (Optimal) duplication is not elementary recursive (Q1881231) (← links)
- Complexity Hierarchies beyond Elementary (Q2828216) (← links)