Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
From MaRDI portal
Publication:4673356
DOI10.1093/logcom/exh036zbMath1077.03021OpenAlexW2081052991WikidataQ57733215 ScholiaQ57733215MaRDI QIDQ4673356
Paulin Jacobé de Naurois, Jean-Yves Marion, Felipe Cucker, Olivier Bournez
Publication date: 29 April 2005
Published in: Journal of Logic and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/7f4a4a82896b8f7d8b8e1007a27fbdfdc405e0e4
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (3)
Simulation of simultaneous safe recursion over an arbitrary structure ⋮ Implicit complexity over an arbitrary structure: Quantifier alternations ⋮ Exotic quantifiers, complexity classes, and complete problems
This page was built for publication: Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time
