New Computational Paradigms

DOI10.1007/b136981zbMath1115.68052OpenAlexW2278484831MaRDI 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (6)

A Characterization of NC k by First Order Functional Programs ⋮ Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time ⋮ Distributing and parallelizing non-canonical loops ⋮ Closed-form upper bounds in static cost analysis ⋮ Recursion Schemata for NC k ⋮ Cost analysis of object-oriented bytecode programs

This page was built for publication: New Computational Paradigms