scientific article
From MaRDI portal
Publication:3962468
zbMath0497.68024MaRDI QIDQ3962468
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Complexity of computation (including implicit computational complexity) (03D15) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Boolean circuits versus arithmetic circuits, Lower bounds on degrees of game-theoretic structures, Feasible arithmetic computations: Valiant's hypothesis, On the definability of properties of finite graphs
