Computational Complexity: A Modern Approach

Reference note

Why this source is in the ledger

Sanjeev Arora and Boaz Barak, Computational Complexity: A Modern Approach, Cambridge University Press (2009), https://theory.cs.princeton.edu/complexity/.

Catalog connections

Conjectures citing this source

• TCS-002$NP$ versus $coNP$Theoretical computer science
• TCS-003$L$ versus $NL$Theoretical computer science
• TCS-004$P=BPP$ Derandomization ConjectureTheoretical computer science
• TCS-005$P$ versus $NC$Theoretical computer science
• TCS-006$NP\nsubseteq P/poly$Theoretical computer science
• TCS-017Berman–Hartmanis Isomorphism ConjectureTheoretical computer science

Source record

Bibliographic fields