2013/01/01 by John M. Hitchcock, A. Pavan · 1 citation
Computer Science · Mathematics · #Advice (programming) #Algorithm #Combinatorics #Completeness (order theory) #Complexity and Algorithms in Graphs #Complexity class #Computational complexity theory #Computer science #Discrete mathematics #Exponential function #Machine Learning and Algorithms #Mathematical proof #Mathematics #Oracle #PSPACE #Pigeonhole principle #Pseudorandom number generator #Randomness #Statistics #Structural complexity theory #Time complexity #semigroups and automata theory
paper · doi:10.1007/978-3-642-40313-2_48
crossref issued 2013/01/01 · crossref published 2013/01/01 · crossref published-print 2013/01/01 · openalex publication_date 2013/01/01 · crossref created 2013/08/16 · crossref deposited 2019/05/19 · crossref indexed 2024/09/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29