scientific article; zbMATH DE number 6789267
From MaRDI portal
DOI10.4230/LIPIcs.CCC.2016.2zbMath1380.68234arXiv1601.04743MaRDI QIDQ5368736
Publication date: 10 October 2017
Full work available at URL: https://arxiv.org/abs/1601.04743
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)
Related Items
A Hierarchy Theorem for Interactive Proofs of Proximity, A short note on Merlin-Arthur protocols for subset sum, Proofs of Work from worst-case assumptions, Subquadratic algorithms for succinct stable matching, Unnamed Item, Unnamed Item, Improved Merlin-Arthur protocols for central problems in fine-grained complexity, Unnamed Item, On the complexity of compressing obfuscation, Generalized Kakeya sets for polynomial evaluation and faster computation of fermionants, Unnamed Item, Efficiently enumerating hitting sets of hypergraphs arising in data profiling, The Orthogonal Vectors Conjecture for Branching Programs and Formulas, Unnamed Item
