The complexity of explicit constructions

DOI10.1007/978-3-642-13962-8_41MaRDI QIDQ3576225zbMATH OpenOpenAlexFDO

Authors Rahul Santhanam

Publication date 29 July 2010

Published in Programs, Proofs, Processes (Search for Journal in Brave)

Full work available at URL https://www.pure.ed.ac.uk/ws/files/17928529/Santhanam_2010_The_Complexity_of_Explicit_Constructions.pdf

zbMATH Keywords

computational complexityexplicit constructions

Mathematics Subject Classification ID

Extremal set theory (05D05) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• The complexity of explicit constructions
• Pseudorandomness and Combinatorial Constructions
• scientific article; zbMATH DE number 18979
• The unified theory of pseudorandomness
• scientific article; zbMATH DE number 1833398

Cited in

(5)

• On the complexity of specification morphisms
• Exact complexity: the spectral decomposition of intrinsic computation
• Explicit constructions of extractors and expanders
• Pseudorandomness and Combinatorial Constructions
• The complexity of explicit constructions

This page was built for publication: The complexity of explicit constructions

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