A Characterization of Alternating Log Time by First Order Functional Programs

DOI10.1007/11916277_7zbMath1138.68357OpenAlexW1581128411MaRDI QIDQ5387886

Jean-Yves Marion, Guillaume Bonfante, Romain Péchoux

Publication date: 27 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00110014/file/44.pdf

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

A Characterization of NC k by First Order Functional Programs ⋮ Recursion Schemata for NC k ⋮ Quasi-interpretations. A way to control resources

This page was built for publication: A Characterization of Alternating Log Time by First Order Functional Programs