scientific article; zbMATH DE number 6789572
From MaRDI portal
Publication:5368903
DOI10.4086/toc.2017.v013a004zbMath1378.68053OpenAlexW2787265165MaRDI QIDQ5368903
Cody D. Murray, R. Ryan Williams
Publication date: 11 October 2017
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2017.v013a004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (13)
Minimum Circuit Size, Graph Isomorphism, and Related Problems ⋮ Non-Black-Box Worst-Case to Average-Case Reductions Within \(\mathsf{NP}\) ⋮ MCSP is hard for read-once nondeterministic branching programs ⋮ Cryptographic hardness under projections for time-bounded Kolmogorov complexity ⋮ Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity ⋮ Hardness of sparse sets and minimal circuit size problem ⋮ Minimum Circuit Size, Graph Isomorphism, and Related Problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The non-hardness of approximating circuit size ⋮ Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization ⋮ Lower bounds and hardness magnification for sublinear-time shrinking cellular automata
This page was built for publication:
