scientific article; zbMATH DE number 3784267

MaRDI QIDQ3962468zbMATH OpenFDO

Authors Allan Borodin

Publication date 1982

zbMATH Keywords

low-level complexitylower boundsmodels of computationsurvey

Mathematics Subject Classification ID

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) Analysis of algorithms and problem complexity (68Q25)

Cited in

(5)

• Lower bounds on degrees of game-theoretic structures
• Feasible arithmetic computations: Valiant's hypothesis
• Boolean circuits versus arithmetic circuits
• The 1982 ACM Turing Award lecture. An overview of computational complexity
• On the definability of properties of finite graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3962468)