Pages that link to "Item:Q1827396"
From MaRDI portal
The following pages link to On the computational complexity of imperative programming languages (Q1827396):
Displaying 12 items.
- Implicit characterizations of FPTIME and NC revisited (Q1044672) (← links)
- Control structures in programs and computational complexity (Q1772780) (← links)
- The fixed point problem of a simple reversible language (Q1989327) (← links)
- Algorithmically broad languages for polynomial time and space (Q2148807) (← links)
- The Power of Non-determinism in Higher-Order Implicit Complexity (Q2988663) (← links)
- A Short Introduction to Implicit Computational Complexity (Q3166988) (← links)
- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time (Q3507419) (← links)
- The Garland Measure and Computational Complexity of Stack Programs (Q4916233) (← links)
- A Refinement of the μ-measure for Stack Programs (Q4916234) (← links)
- ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS (Q4923290) (← links)
- (Q5028427) (← links)
- (Q5114822) (← links)