Pages that link to "Item:Q5470728"
From MaRDI portal
The following pages link to Certifying Polynomial Time and Linear/Polynomial Space for Imperative Programs (Q5470728):
Displayed 11 items.
- Cost analysis of object-oriented bytecode programs (Q764297) (← links)
- Implicit characterizations of FPTIME and NC revisited (Q1044672) (← links)
- A type-based complexity analysis of object oriented programs (Q1640983) (← links)
- Algorithmically broad languages for polynomial time and space (Q2148807) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- A Characterization of NC k by First Order Functional Programs (Q3502640) (← links)
- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time (Q3507419) (← links)
- Recursion Schemata for NC k (Q3540170) (← links)
- ON THE EDGE OF DECIDABILITY IN COMPLEXITY ANALYSIS OF LOOP PROGRAMS (Q4923290) (← links)
- (Q5028427) (← links)
- (Q5114822) (← links)