Logical Approaches to Computational Barriers

DOI10.1007/11780342zbMath1145.03312OpenAlexW4255986326WikidataQ55968647 ScholiaQ55968647MaRDI QIDQ5898843

Mihai Prunescu

Publication date: 30 April 2007

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

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

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantifier elimination, model completeness, and related topics (03C10)

Related Items (1)

Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries

This page was built for publication: Logical Approaches to Computational Barriers