scientific article

From MaRDI portal

Revision as of 00:03, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3962468

Jump to:navigation, search

zbMath0497.68024MaRDI QIDQ3962468

Allan Borodin

Publication date: 1982

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

survey lower bounds models of computation low-level complexity

Mathematics Subject Classification ID

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 (4)

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

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3962468&oldid=17667402"