Pages that link to "Item:Q2843916"

The following pages link to Characterising polynomial time computable functions using theories with weak set existence principles (Q2843916):

Displaying 7 items.

• A weak constructive second-order arithmetic with extraction of algorithms computable in polynomial time (Q937902) (← links)
• A foundational delineation of poly-time (Q1327386) (← links)
• A term rewriting characterization of the functions computable in polynomial space (Q1407521) (← links)
• A second-order system for polytime reasoning based on Grädel's theorem. (Q1412837) (← links)
• Applicative theories for the polynomial hierarchy of time and its levels (Q1946672) (← links)
• Elementary explicit types and polynomial time operations (Q3632522) (← links)
• (Q5313792) (← links)