Pages that link to "Item:Q639668"
From MaRDI portal
The following pages link to A recursion-theoretic approach to NP (Q639668):
Displaying 6 items.
- The polynomial hierarchy of functions and its levels (Q2062128) (← links)
- Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
- Algorithmically broad languages for polynomial time and space (Q2148807) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) (Q2232317) (← links)
- The Power of Non-determinism in Higher-Order Implicit Complexity (Q2988663) (← links)
- Implicit computation complexity in higher-order programming languages (Q5875893) (← links)
