Pages that link to "Item:Q937902"
From MaRDI portal
The following pages link to A weak constructive second-order arithmetic with extraction of algorithms computable in polynomial time (Q937902):
Displaying 4 items.
- An arithmetic for non-size-increasing polynomial-time computation (Q1827388) (← links)
- An arithmetic for polynomial-time computation (Q2500489) (← links)
- Characterising polynomial time computable functions using theories with weak set existence principles (Q2843916) (← links)
- A second step toward the strong polynomial-time hierarchy (Q3816982) (← links)
