Computer Science Logic

From MaRDI portal

Revision as of 01:14, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5394599

Jump to:navigation, search

DOI10.1007/11538363zbMath1136.03323OpenAlexW2479351976MaRDI QIDQ5394599

Jatin Shah, Carsten Schuermann

Publication date: 1 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11538363

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Logic programming (68N17) Recursive functions and relations, subrecursive hierarchies (03D20)

Related Items (1)

A Formalization of Polytime Functions

This page was built for publication: Computer Science Logic

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5394599&oldid=20120463"