default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Colloquium on Computational Complexity, 2021
Volume TR21, 2021
- Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena:
Computation Over the Noisy Broadcast Channel with Malicious Parties. Article TR21-001 - Pooya Hatami, William Hoza, Avishay Tal, Roei Tell:
Fooling Constant-Depth Threshold Circuits. Article TR21-002 - Lijie Chen, Xin Lyu:
Inverse-Exponential Correlation Bounds and Extremely Rigid Matrices from a New Derandomized XOR Lemma. Article TR21-003 - Vishnu Iyer, Avishay Tal, Michael Whitmeyer:
Junta Distance Approximation with Sub-Exponential Queries. Article TR21-004 - Anindya De, Elchanan Mossel, Joe Neeman:
Robust testing of low-dimensional functions. Article TR21-005 - Susanna F. de Rezende, Jakob Nordström, Marc Vinyals:
How Limited Interaction Hinders Real Communication (and What It Means for Proof and Circuit Complexity). Article TR21-006 - Sai Sandeep:
Almost Optimal Inapproximability of Multidimensional Packing Problems. Article TR21-007 - Akash Kumar, C. Seshadhri, Andrew Stolman:
Random walks and forbidden minors III: poly(d/?)-time partition oracles for minor-free graph classes. Article TR21-008 - Eric Allender, Mahdi Cheraghchi, Dimitrios Myrisiotis, Harsha Tirumala, Ilya Volkovich:
One-way Functions and Partial MCSP. Article TR21-009 - Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle:
Cryptographic Hardness under Projections for Time-Bounded Kolmogorov Complexity. Article TR21-010 - Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Classification of the streaming approximability of Boolean CSPs. Article TR21-011 - Noah Fleming, Mika Göös, Russell Impagliazzo, Toniann Pitassi, Robert Robere, Li-Yang Tan, Avi Wigderson:
On the Power and Limitations of Branch and Cut. Article TR21-012 - Srinivasan Arunachalam, Penghui Yao:
Positive spectrahedrons: Geometric properties, Invariance principles and Pseudorandom generators. Article TR21-013 - Dori Medini, Amir Shpilka:
Hitting Sets and Reconstruction for Dense Orbits in VP$_e$ and $\Sigma\Pi\Sigma$ Circuits. Article TR21-014 - Chandan Saha, Bhargav Thankey:
Hitting Sets for Orbits of Circuit Classes and Polynomial Families. Article TR21-015 - Shalev Ben-David, Mika Göös, Siddhartha Jain, Robin Kothari:
Unambiguous DNFs from Hex. Article TR21-016 - Timothy Gowers, Emanuele Viola:
Mixing in non-quasirandom groups. Article TR21-017 - Dean Doron, Raghu Meka, Omer Reingold, Avishay Tal, Salil P. Vadhan:
Monotone Branching Programs: Pseudorandomness and Circuit Complexity. Article TR21-018 - Edward Pyne, Salil P. Vadhan:
Pseudodistributions That Beat All Pseudorandom Generators. Article TR21-019 - Gil Cohen, Dean Doron, Oren Renard, Ori Sberlo, Amnon Ta-Shma:
Error Reduction For Weighted PRGs Against Read Once Branching Programs. Article TR21-020 - Per Austrin, Kilian Risse:
Average-Case Perfect Matching Lower Bounds from Hardness of Tseitin Formulas. Article TR21-021 - Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin:
Depth lower bounds in Stabbing Planes for combinatorial principles. Article TR21-022 - Jiatu Li, Tianqi Yang
:
3.1n - o(n) Circuit Lower Bounds for Explicit Functions. Article TR21-023 - Mika Göös, Gilbert Maystre:
A Majority Lemma for Randomised Query Complexity. Article TR21-024 - Sivakanth Gopi, Venkatesan Guruswami:
Improved Maximally Recoverable LRCs using Skew Polynomials. Article TR21-025 - Joshua Brakensiek, Venkatesan Guruswami, Sai Sandeep:
Conditional Dichotomy of Boolean Ordered Promise CSPs. Article TR21-026 - Lijie Chen, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena, Zhao Song, Huacheng Yu:
Almost Optimal Super-Constant-Pass Streaming Lower Bounds for Reachability. Article TR21-027 - Anastasia Sofronova, Dmitry Sokolov:
Branching Programs with Bounded Repetitions and Flow Formulas. Article TR21-028 - Inbar Kaslasi, Ron Rothblum, Prashant Nalini Vasudevan:
Public-Coin Statistical Zero-Knowledge Batch Verification against Malicious Verifiers. Article TR21-029 - Shuichi Hirahara, Rahul Ilango, Bruno Loff:
Hardness of Constant-round Communication Complexity. Article TR21-030 - Vaibhav Krishan:
Upper Bound for Torus Polynomials. Article TR21-031 - Justin Holmgren, Alex Lombardi, Ron Rothblum:
Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW is not Zero-Knowledge). Article TR21-032 - Susanna F. de Rezende:
Automating Tree-Like Resolution in Time no(log n) Is ETH-Hard. Article TR21-033 - Oded Goldreich:
Robust Self-Ordering versus Local Self-Ordering. Article TR21-034 - Robert Robere, Jeroen Zuiddam:
Amortized Circuit Complexity, Formal Complexity Measures, and Catalytic Algorithms. Article TR21-035 - Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan:
Ideal-theoretic Explanation of Capacity-achieving Decoding. Article TR21-036 - Prerona Chatterjee:
Separating ABPs and Some Structured Formulas in the Non-Commutative Setting. Article TR21-037 - Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. Article TR21-038 - Zhenjian Lu, Igor Carboni Oliveira, Rahul Santhanam:
Pseudodeterministic Algorithms and the Structure of Probabilistic Time. Article TR21-039 - Lijie Chen, Zhenjian Lu, Xin Lyu, Igor Carboni Oliveira:
Majority vs. Approximate Linear Sum and Average-Case Complexity Below NC1. Article TR21-040 - Zhenjian Lu, Igor Carboni Oliveira:
An Efficient Coding Theorem via Probabilistic Representations and its Applications. Article TR21-041 - Dana Moshkovitz:
Strong Parallel Repetition for Unique Games on Small Set Expanders. Article TR21-042 - Peter Dixon, Aduri Pavan, N. V. Vinodchandran:
Promise Problems Meet Pseudodeterminism. Article TR21-043 - Alexander S. Kulikov, Nikita Slezkin:
SAT-based Circuit Local Improvement. Article TR21-044 - Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction Algorithms for Low-Rank Tensors and Depth-3 Multilinear Circuits. Article TR21-045 - Uma Girish, Avishay Tal, Kewen Wu:
Fourier Growth of Parity Decision Trees. Article TR21-046 - Zander Kelley, Raghu Meka:
Random restrictions and PRGs for PTFs in Gaussian Space. Article TR21-047 - William Hoza:
Better Pseudodistributions and Derandomization for Space-Bounded Computation. Article TR21-048 - Juraj Hromkovic:
Kolmogorov complexity and nondeterminism versus determinism for polynomial time computations. Article TR21-049 - Marshall Ball, Alper Çakan, Tal Malkin:
Linear Threshold Secret-Sharing with Binary Reconstruction. Article TR21-050 - Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Binary Interactive Error Resilience Beyond $1/8$ (or why $(1/2)^3 > 1/8$). Article TR21-051 - Benny Applebaum, Oded Nir:
Upslices, Downslices, and Secret-Sharing with Complexity of $1.5^n$. Article TR21-052 - Jan Krajícek:
Information in propositional proofs and algorithmic proof search. Article TR21-053 - James Cook, Ian Mertz:
Encodings and the Tree Evaluation Problem. Article TR21-054 - Yanyi Liu, Rafael Pass:
Cryptography from Sublinear-Time Average-Case Hardness of Time-Bounded Kolmogorov Complexity. Article TR21-055 - Yanyi Liu, Rafael Pass:
On the Possibility of Basing Cryptography on $\EXP \neq \BPP$. Article TR21-056 - Hanlin Ren, Rahul Santhanam:
Hardness of KT Characterizes Parallel Cryptography. Article TR21-057 - Shuichi Hirahara:
Average-Case Hardness of NP from Exponential Worst-Case Hardness Assumptions. Article TR21-058 - Yanyi Liu, Rafael Pass:
On One-way Functions from NP-Complete Problems. Article TR21-059 - Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Optimal Error Resilience of Adaptive Message Exchange. Article TR21-060 - Noah Fleming, Toniann Pitassi:
Reflections on Proof Complexity and Counting Principles. Article TR21-061 - Vishwas Bhargava, Sumanta Ghosh:
Improved Hitting Set for Orbit of ROABPs. Article TR21-062 - Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Santhoshini Velusamy:
Approximability of all finite CSPs in the dynamic streaming setting. Article TR21-063 - Noah Singer, Madhu Sudan, Santhoshini Velusamy:
Streaming approximation resistance of every ordering CSP. Article TR21-064 - Nikhil S. Mande, Swagato Sanyal:
One-way communication complexity and non-adaptive decision trees. Article TR21-065 - Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami:
Dimension-free Bounds and Structural Results in Communication Complexity. Article TR21-066 - Zeyu Guo:
Variety Evasive Subspace Families. Article TR21-067 - Marcel de Sena Dall'Agnol, Tom Gur, Subhayan Roy Moulik, Justin Thaler:
Quantum Proofs of Proximity. Article TR21-068 - Dominik Scheder:
PPSZ is better than you think. Article TR21-069 - Shuo Pang:
SOS lower bound for exact planted clique. Article TR21-070 - Samuel Epstein:
On the Algorithmic Content of Quantum Measurements. Article TR21-071 - Pranjal Dutta, Gorav Jindal, Anurag Pandey, Amit Sinhababu:
Arithmetic Circuit Complexity of Division and Truncation. Article TR21-072 - Emanuele Viola:
Lower bounds for samplers and data structures via the cell-probe separator. Article TR21-073 - Theodoros Papamakarios, Alexander A. Razborov:
Space characterizations of complexity measures and size-space trade-offs in propositional proof systems. Article TR21-074 - Eshan Chattopadhyay, Jesse Goodman, Jyun-Jie Liao:
Affine Extractors for Almost Logarithmic Entropy. Article TR21-075 - Dmitry Sokolov:
Pseudorandom Generators, Resolution and Heavy Width. Article TR21-076 - Shir Peleg, Amir Shpilka, Ben Lee Volk:
Lower Bounds on Stabilizer Rank. Article TR21-077 - Rahul Jain, Srijita Kundu:
A direct product theorem for quantum communication complexity with applications to device-independent QKD. Article TR21-078 - Venkatesan Guruswami, Xiaoyu He, Ray Li:
The zero-rate threshold for adversarial bit-deletions is less than 1/2. Article TR21-079 - Lijie Chen, Roei Tell:
Hardness vs Randomness, Revised: Uniform, Non-Black-Box, and Instance-Wise. Article TR21-080 - Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits. Article TR21-081 - Rahul Ilango, Hanlin Ren, Rahul Santhanam:
Hardness on any Samplable Distribution Suffices: New Characterizations of One-Way Functions by Meta-Complexity. Article TR21-082 - Mark Braverman, Sumegha Garg, Or Zamir:
Tight Space Complexity of the Coin Problem. Article TR21-083 - Liron Bronfman, Ron Rothblum:
PCPs and Instance Compression from a Cryptographic Lens. Article TR21-084 - Ilya Volkovich:
The Final Nail in the Coffin of Statistically-Secure Obfuscator. Article TR21-085 - Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, Santhoshini Velusamy:
Linear Space Streaming Lower Bounds for Approximating CSPs. Article TR21-086 - Uma Girish, Ran Raz:
Eliminating Intermediate Measurements using Pseudorandom Generators. Article TR21-087 - Oded Goldreich:
Open Problems in Property Testing of Graphs. Article TR21-088 - Hanlin Ren, Rahul Santhanam:
A Relativization Perspective on Meta-Complexity. Article TR21-089 - Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro:
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. Article TR21-090 - Gil Cohen, Dor Minzer, Shir Peleg, Aaron Potechin, Amnon Ta-Shma:
Expander Random Walks: The General Case and Limitations. Article TR21-091 - Yanyi Liu, Rafael Pass:
A Note on One-way Functions and Sparse Languages. Article TR21-092 - Andrej Bogdanov, Krishnamoorthy Dinesh, Yuval Filmus, Yuval Ishai, Avi Kaplan, Akshayaram Srinivasan:
Bounded Indistinguishability for Simple Sources. Article TR21-093 - Nutan Limaye, Srikanth Srinivasan, Sébastien Tavenas:
New Non-FPT Lower Bounds for Some Arithmetic Formulas. Article TR21-094 - Marco Carmosino, Valentine Kabanets, Antonina Kolokolova, Igor C. Oliveira:
LEARN-Uniform Circuit Lower Bounds and Provability in Bounded Arithmetic. Article TR21-095 - Boaz Menuhin, Moni Naor:
Keep That Card in Mind: Card Guessing with Limited Memory. Article TR21-096 - Jacobo Torán, Florian Wörz:
Number of Variables for Graph Identification and the Resolution of GI Formulas. Article TR21-097 - Srikanth Srinivasan, S. Venkitesh:
On the Probabilistic Degree of an $n$-variate Boolean Function. Article TR21-098 - Louis Golowich:
Improved Product-Based High-Dimensional Expanders. Article TR21-099 - Christian Ikenmeyer, Balagopal Komarath, Nitin Saurabh:
Karchmer-Wigderson Games for Hazard-free Computation. Article TR21-100 - Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
A Parallel Repetition Theorem for the GHZ Game: A Simpler Proof. Article TR21-101 - Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, Amir Yehudayoff:
Tight bounds on the Fourier growth of bounded functions on the hypercube. Article TR21-102 - Eli Ben-Sasson, Dan Carmon, Swastik Kopparty, David Levit:
Elliptic Curve Fast Fourier Transform (ECFFT) Part I: Fast Polynomial Algorithms over all Finite Fields. Article TR21-103 - Sravanthi Chede, Anil Shukla:
Does QRAT simulate IR-calc? QRAT simulation algorithm for $\forall$Exp+Res cannot be lifted to IR-calc. Article TR21-104 - Suryajith Chillara:
Functional lower bounds for restricted arithmetic circuits of depth four. Article TR21-105 - Eshan Chattopadhyay, Jesse Goodman, David Zuckerman:
The Space Complexity of Sampling. Article TR21-106 - Igor Razgon:
Classification of OBDD size for monotone 2-CNFs. Article TR21-107 - Edward Pyne, Salil P. Vadhan:
Limitations of the Impagliazzo-Nisan-Wigderson Pseudorandom Generator against Permutation Branching Programs. Article TR21-108 - Sravanthi Chede, Anil Shukla:
QRAT Polynomially Simulates Merge Resolution. Article TR21-109 - Jaroslaw Blasiok, Peter Ivanov, Yaonan Jin, Chin Ho Lee, Rocco A. Servedio, Emanuele Viola:
Fourier growth of structured 𝔽2-polynomials and applications. Article TR21-110 - Aniruddha Biswas, Palash Sarkar:
Influence of a Set of Variables on a Boolean Function. Article TR21-111 - Vikraman Arvind, Venkatesan Guruswami:
CNF Satisfiability in a Subspace and Related Problems. Article TR21-112 - Nikhil S. Mande, Ronald de Wolf:
Tight Bounds for the Randomized and Quantum Communication Complexities of Equality with Small Error. Article TR21-113 - Henning Fernau, Kshitij Gajjar:
The Space Complexity of Sum Labelling. Article TR21-114 - Scott Aaronson, Andris Ambainis, Andrej Bogdanov, Krishnamoorthy Dinesh, Tsun Ming Cheung:
On quantum versus classical query complexity. Article TR21-115 - Nai-Hui Chia, Chi-Ning Chou, Jiayu Zhang, Ruizhe Zhang:
Quantum Meets the Minimum Circuit Size Problem. Article TR21-116 - Divesh Aggarwal, Bhavana Kanukurthi, Sai Lakshmi Bhavana Obbattu, Maciej Obremski, Sruthi Sekar:
Simplicity Meets Near-Optimal Rate: Non-malleable Codes and Non-malleable Two-source Extractors via Rate Boosters. Article TR21-117 - Daniel Augot, Sarah Bordage, Jade Nardi:
Efficient multivariate low-degree tests via interactive oracle proofs of proximity for polynomial codes. Article TR21-118 - Omar Alrabiah, Venkatesan Guruswami:
Visible Rank and Codes with Locality. Article TR21-119 - Roei Tell:
How to Find Water in the Ocean: A Survey on Quantified Derandomization. Article TR21-120 - Sumanta Ghosh, Rohit Gurjar:
Matroid Intersection: A pseudo-deterministic parallel reduction from search to weighted-decision. Article TR21-121 - Sabyasachi Basu, Akash Kumar, C. Seshadhri:
The complexity of testing all properties of planar graphs, and the role of isomorphism. Article TR21-122 - Ben Davis, Hamed Hatami, William Pires, Ran Tao, Hamza Usmani:
On public-coin zero-error randomized communication complexity. Article TR21-123 - Iftach Haitner, Noam Mazor, Jad Silbak, Eliad Tsfadia:
On the Complexity of Two-Party Differential Privacy. Article TR21-124 - Zhiyuan Fan, Jiatu Li, Tianqi Yang:
The Exact Complexity of Pseudorandom Functions and Tight Barriers to Lower Bound Proofs. Article TR21-125 - Yilei Chen, Qipeng Liu, Mark Zhandry:
Quantum Algorithms for Variants of Average-Case Lattice Problems via Filtering. Article TR21-126 - Ron D. Rothblum, Michael Ezra:
Small Circuits Imply Efficient Arthur-Merlin Protocols. Article TR21-127 - Xiaotie Deng, Yuhao Li, David Mguni, Jun Wang, Yaodong Yang:
On the Complexity of Computing Markov Perfect Equilibrium in General-Sum Stochastic Games. Article TR21-128 - Oded Goldreich, Dana Ron:
A Lower Bound on the Complexity of Testing Grained Distributions. Article TR21-129 - Srinivasan Arunachalam, João F. Doriguello:
Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case. Article TR21-130 - Olaf Beyersdorff, Benjamin Böhm:
QCDCL with Cube Learning or Pure Literal Elimination - What is best? Article TR21-131 - Eric Binnendyk:
Pseudo-random functions and uniform learnability. Article TR21-132 - Oded Goldreich, Dana Ron:
Testing Distributions of Huge Objects. Article TR21-133 - Siddharth Bhaskar:
A refinement of the Meyer-McCreight Union Theorem. Article TR21-134 - Olaf Beyersdorff, Joshua Blinkhorn, Tomás Peitl:
Strong (D)QBF Dependency Schemes via Implication-free Resolution Paths. Article TR21-135 - Gil Cohen, Tal Yankovitz:
LCC and LDC: Tailor-made distance amplification and a refined separation. Article TR21-136 - Xuangui Huang, Peter Ivanov, Emanuele Viola:
Affine extractors and AC0-Parity. Article TR21-137 - Rahul Santhanam, Iddo Tzameret:
Iterated Lower Bound Formulas: A Diagonalization-Based Approach to Proof Complexity. Article TR21-138 - Venkatesan Guruswami, Jonathan Mosheiff:
Punctured Large Distance Codes, and Many Reed-Solomon Codes, Achieve List-Decoding Capacity. Article TR21-139 - Nathan Geier:
Tight Computational Indistinguishability Bound of Product Distributions. Article TR21-140 - Alexander Golovnev, Siyao Guo, Spencer Peters, Noah Stephens-Davidowitz:
On the (im)possibility of branch-and-bound search-to-decision reductions for approximate optimization. Article TR21-141 - Amey Bhangale, Prahladh Harsha, Sourya Roy:
Mixing of 3-term progressions in Quasirandom Groups. Article TR21-142 - Edward Pyne:
Hitting Sets For Regular Branching Programs. Article TR21-143 - Leroy Chew, Friedrich Slivovsky:
Towards Uniform Certification in QBF. Article TR21-144 - Omar Alrabiah, Venkatesan Guruswami:
Revisiting a Lower Bound on the Redundancy of Linear Batch Codes. Article TR21-145 - Guy Goldberg, Guy N. Rothblum:
Sample-Based Proofs of Proximity. Article TR21-146 - Eshan Chattopadhyay, Jyun-Jie Liao:
Extractors for Sum of Two Sources. Article TR21-147 - Benjamin E. Diamond, Amir Yehudayoff:
Explicit Exponential Lower Bounds for Exact Hyperplane Covers. Article TR21-148 - Sevag Gharibian, Dorian Rudolph:
On polynomially many queries to NP or QMA oracles. Article TR21-149 - Eldon Chung, Maciej Obremski, Divesh Aggarwal:
Extractors: Low Entropy Requirements Colliding With Non-Malleability. Article TR21-150 - Irit Dinur, Shai Evra, Ron Livne, Alexander Lubotzky, Shahar Mozes:
Locally Testable Codes with constant rate, distance, and locality. Article TR21-151 - Gal Arnon, Tomer Grossman:
Min-Entropic Optimality. Article TR21-152 - Ronen Shaltiel, Emanuele Viola:
On Hardness Assumptions Needed for "Extreme High-End" PRGs and Fast Derandomization. Article TR21-153 - Inbar Ben Yaacov, Gil Cohen, Tal Yankovitz:
Explicit Binary Tree Codes with Sub-Logarithmic Size Alphabet. Article TR21-154 - Vishwas Bhargava, Ankit Garg, Neeraj Kayal, Chandan Saha:
Learning generalized depth-three arithmetic circuits in the non-degenerate case. Article TR21-155 - Boris Bukh, Karthik C. S., Bhargav Narayanan:
Applications of Random Algebraic Constructions to Hardness of Approximation. Article TR21-156 - Monika Henzinger, Andrea Lincoln, Barna Saha:
The Complexity of Average-Case Dynamic Subgraph Counting. Article TR21-157 - Noah Fleming, Toniann Pitassi, Robert Robere:
Extremely Deep Proofs. Article TR21-158 - Lijie Chen, Ce Jin, Rahul Santhanam, Ryan Williams:
Constructive Separations and Their Consequences. Article TR21-159 - Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena:
Tight Bounds for General Computation in Noisy Broadcast Networks. Article TR21-160 - Shuichi Hirahara, Mikito Nanashima:
On Worst-Case Learning in Relativized Heuristica. Article TR21-161 - Vishwas Bhargava, Sumanta Ghosh, Mrinal Kumar, Chandra Kanta Mohapatra:
Fast, Algebraic Multivariate Multipoint Evaluation in Small Characteristic and Applications. Article TR21-162 - Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar:
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. Article TR21-163 - Scott Aaronson, DeVon Ingram, William Kretschmer:
The Acrobatics of BQP. Article TR21-164 - Shyan Akmal, Lijie Chen, Ce Jin, Malvika Raj, Ryan Williams:
Improved Merlin-Arthur Protocols for Central Problems in Fine-Grained Complexity. Article TR21-165 - Lijie Chen, Shuichi Hirahara, Neekon Vafa:
Average-case Hardness of NP and PH from Worst-case Fine-grained Assumptions. Article TR21-166 - Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably). Article TR21-167 - Tom Gur, Noam Lifshitz, Siqi Liu:
Hypercontractivity on High Dimensional Expanders: Approximate Efron-Stein Decompositions for $\epsilon$-Product Spaces. Article TR21-168 - Mitali Bafna, Max Hopkins, Tali Kaufman, Shachar Lovett:
Hypercontractivity on High Dimensional Expanders: a Local-to-Global Approach for Higher Moments. Article TR21-169 - Reyad Abed Elrazik, Robert Robere, Assaf Schuster, Gal Yehuda:
Pseudorandom Self-Reductions for NP-Complete Problems. Article TR21-170 - Bruno Pasqualotto Cavalar, Zhenjian Lu:
Algorithms and Lower Bounds for Comparator Circuits from Shrinkage. Article TR21-171 - Robert Andrews, Michael A. Forbes:
Ideals, Determinants, and Straightening: Proving and Using Lower Bounds for Polynomial Ideals. Article TR21-172 - Ninad Rajgopal, Rahul Santhanam:
On the Structure of Learnability beyond P/poly. Article TR21-173 - Tom Gur, Min-Hsiu Hsieh, Sathyawageeswar Subramanian:
Sublinear quantum algorithms for estimating von Neumann entropy. Article TR21-174 - Oded Goldreich:
On the Locally Testable Code of Dinur et al. (2021). Article TR21-175 - Theodoros Papamakarios:
A super-polynomial separation between resolution and cut-free sequent calculus. Article TR21-176 - Vincent Cohen-Addad, Karthik C. S., Euiwoong Lee:
Johnson Coverage Hypothesis: Inapproximability of k-means and k-median in $\ell_p$-metrics. Article TR21-177 - Srinivasan Arunachalam, Oded Regev, Penghui Yao:
On the Gaussian surface area of spectrahedra. Article TR21-178 - Tatsuie Tsukiji:
Smoothed Complexity of Learning Disjunctive Normal Forms, Inverting Fourier Transforms, and Verifying Small Circuits. Article TR21-179 - Noga Ron-Zewi, Ron Rothblum:
Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead. Article TR21-180 - Oded Goldreich:
The KW Games as a Teaser. Article TR21-181 - Ilario Bonacina, Maria Luisa Bonet:
On the strength of Sherali-Adams and Nullstellensatz as propositional proof systems. Article TR21-182
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-04-17 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
