COMPLEXITY OF UNIVERSAL CIRCUMSCRIPTION
From MaRDI portal
Publication:4286111
DOI10.1142/S0129054193000158zbMath0802.68139OpenAlexW2058110110MaRDI QIDQ4286111
Publication date: 27 April 1994
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054193000158
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)
This page was built for publication: COMPLEXITY OF UNIVERSAL CIRCUMSCRIPTION