Pages that link to "Item:Q1193623"

The following pages link to Characterizing complexity classes by higher type primitive recursive definitions (Q1193623):

Displaying 12 items.

• Bounded combinatory logic and lower complexity (Q276270) (← links)
• Complexity-theoretic hierarchies induced by fragments of Gödel's \(T\) (Q1015376) (← links)
• Characterizing complexity classes by general recursive definitions in higher types (Q1207943) (← links)
• Higher type recursion, ramification and polynomial time (Q1577477) (← links)
• Realizability models for BLL-like languages (Q1827395) (← links)
• Computational Complexity Via Finite Types (Q2946764) (← links)
• The Power of Non-determinism in Higher-Order Implicit Complexity (Q2988663) (← links)
• Characterizing Polynomial and Exponential Complexity Classes in Elementary Lambda-Calculus (Q3190158) (← links)
• (Q3203014) (← links)
• Recursion in Higher Types and Resource Bounded Turing Machines (Q3507448) (← links)
• Characterizing complexity classes by higher type primitive recursive definitions. II (Q3979266) (← links)
• Implicit computation complexity in higher-order programming languages (Q5875893) (← links)