New Computational Paradigms
From MaRDI portal
Publication:5717049
DOI10.1007/b136981zbMath1115.68052MaRDI QIDQ5717049
Lars Kristiansen, Neil D. Jones
Publication date: 11 January 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136981
68Q25: Analysis of algorithms and problem complexity
03B70: Logic in computer science
68N30: Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.)
Related Items
Distributing and parallelizing non-canonical loops, Cost analysis of object-oriented bytecode programs, Closed-form upper bounds in static cost analysis, A Characterization of NC k by First Order Functional Programs, Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time, Recursion Schemata for NC k