scientific article
From MaRDI portal
Publication:3793690
zbMath0648.68008MaRDI QIDQ3793690
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
complexitycomputational complexityTuring machinescircuit complexitytime-space tradeoffsNP- completesequential machines
Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (1)
This page was built for publication: