default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDElectronic Colloquium on Computational Complexity, 2019
Volume TR19, 2019
- Dmitry Itsykson, Alexander Knop, Andrei E. Romashchenko, Dmitry Sokolov:
On OBDD-based algorithms and proof systems that dynamically change order of variables. Article TR19-001 - Alexander S. Kulikov, Ivan Mikhailin, Andrey Mokhov, Vladimir V. Podolskii:
Complexity of Linear Operators. Article TR19-002 - Alexander A. Sherstov, Pei Wu:
Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC^0. Article TR19-003 - Amey Bhangale, Subhash Khot:
UG-hardness to NP-hardness by Losing Half. Article TR19-004 - Omar Alrabiah, Venkatesan Guruswami:
An Exponential Lower Bound on the Sub-Packetization of MSR Codes. Article TR19-005 - Anna Gál, Ridwan Syed:
Upper Bounds on Communication in terms of Approximate Rank. Article TR19-006 - Arkadev Chattopadhyay, Meena Mahajan, Nikhil S. Mande, Nitin Saurabh:
Lower Bounds for Linear Decision Lists. Article TR19-007 - Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Efficiently factoring polynomials modulo $p^4$. Article TR19-008 - Jiawei Gao, Russell Impagliazzo:
The Fine-Grained Complexity of Strengthenings of First-Order Logic. Article TR19-009 - Dorit Aharonov, Alex Bredariol Grilo:
Stoquastic PCP vs. Randomness. Article TR19-010 - Benny Applebaum, Eliran Kachlon:
Sampling Graphs without Forbidden Subgraphs and Almost-Explicit Unbalanced Expanders. Article TR19-011 - Oded Goldreich:
Multi-pseudodeterministic algorithms. Article TR19-012 - Joshua Brakensiek, Sivakanth Gopi, Venkatesan Guruswami:
CSPs with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations. Article TR19-013 - Himanshu Tyagi, Shun Watanabe:
A New Proof of Nonsignalling Multiprover Parallel Repetition Theorem. Article TR19-014 - William Kretschmer:
QMA Lower Bounds for Approximate Counting. Article TR19-015 - Alexander A. Sherstov:
The hardest halfspace. Article TR19-016 - Chin Ho Lee:
Fourier bounds and pseudorandom generators for product tests. Article TR19-017 - Alexander Golovnev, Rahul Ilango, Russell Impagliazzo, Valentine Kabanets, Antonina Kolokolova, Avishay Tal:
AC0[p] Lower Bounds against MCSP via the Coin Problem. Article TR19-018 - Mrinal Kumar, Rafael Mendes de Oliveira, Ramprasad Saptharishi:
Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. Article TR19-019 - Ludmila Glinskih, Dmitry Itsykson:
On Tseitin formulas, read-once branching programs and treewidth. Article TR19-020 - Rahul Ilango:
$AC^0[p]$ Lower Bounds and NP-Hardness for Variants of MCSP. Article TR19-021 - Mahdi Cheraghchi, Valentine Kabanets, Zhenjian Lu, Dimitrios Myrisiotis:
Circuit Lower Bounds for MCSP from Local Pseudorandom Generators. Article TR19-022 - Orr Paradise:
Smooth and Strong PCPs. Article TR19-023 - Russell Impagliazzo, Sasank Mouli, Toniann Pitassi:
The Surprising Power of Constant Depth Algebraic Proofs. Article TR19-024 - Shuichi Hirahara, Osamu Watanabe:
On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets. Article TR19-025 - Pavel Hrubes, Sivaramakrishnan Natarajan Ramamoorthy, Anup Rao, Amir Yehudayoff:
Lower Bounds on Balancing Sets and Depth-2 Threshold Circuits. Article TR19-026 - Mark Bun, Nikhil S. Mande, Justin Thaler:
Sign-Rank Can Increase Under Intersection. Article TR19-027 - Shachar Lovett, Noam Solomon, Jiapeng Zhang:
From DNF compression to sunflower theorems via regularity. Article TR19-028 - Yuval Filmus, Lianna Hambardzumyan, Hamed Hatami, Pooya Hatami, David Zuckerman:
Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. Article TR19-029 - Claude Crépeau, Nan Yang:
Non-Locality in Interactive Proofs. Article TR19-030 - Lijie Chen:
Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits. Article TR19-031 - Srikanth Srinivasan:
Strongly Exponential Separation Between Monotone VP and Monotone VNP. Article TR19-032 - Ashish Dwivedi, Rajat Mittal, Nitin Saxena:
Counting basic-irreducible factors mod $p^k$ in deterministic poly-time and $p$-adic applications. Article TR19-033 - Pavel Hrubes:
On $\epsilon$-sensitive monotone computations. Article TR19-034 - Alexey Milovanov:
PIT for depth-4 circuits and Sylvester-Gallai theorem for polynomials. Article TR19-035 - Pavel Hrubes:
On the complexity of computing a random Boolean function over the reals. Article TR19-036 - Chi-Ning Chou, Mrinal Kumar, Noam Solomon:
Closure of VP under taking factors: a short and simple proof. Article TR19-037 - Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan:
Statistical Difference Beyond the Polarizing Regime. Article TR19-038 - Eric Allender, Archit Chauhan, Samir Datta, Anish Mukherjee:
Planarity, Exclusivity, and Unambiguity. Article TR19-039 - Sanjana Kolisetty, Linh Le, Ilya Volkovich, Mihalis Yannakakis:
The Complexity of Finding S-factors in Regular Graphs. Article TR19-040 - Srinivasan Arunachalam, Alex Bredariol Grilo, Aarthi Sundaram:
Quantum hardness of learning shallow classical circuits. Article TR19-041 - Ankit Garg, Nikhil Gupta, Neeraj Kayal, Chandan Saha:
Determinant equivalence test over finite fields and over ℚ. Article TR19-042 - Toniann Pitassi, Morgan Shirley, Thomas Watson:
Nondeterministic and Randomized Boolean Hierarchies in Communication Complexity. Article TR19-043 - Eli Ben-Sasson, Lior Goldberg, Swastik Kopparty, Shubhangi Saraf:
DEEP-FRI: Sampling Outside the Box Improves Soundness. Article TR19-044 - Jiawei Gao:
On the Fine-grained Complexity of Least Weight Subsequence in Graphs. Article TR19-045 - Akash Kumar, C. Seshadhri, Andrew Stolman:
andom walks and forbidden minors II: A poly(dε-1)$-query tester for minor-closed properties of bounded degree graphs. Article TR19-046 - Mrinal Kumar, Ben Lee Volk:
Lower Bounds for Matrix Factorization. Article TR19-047 - Per Austrin, Amey Bhangale, Aditya Potukuchi:
Simplified inpproximability of hypergraph coloring via t-agreeing families. Article TR19-048 - Itay Berman, Iftach Haitner, Eliad Tsfadia:
A Tight Parallel-Repetition Theorem for Random-Terminating Interactive Arguments. Article TR19-049 - Titus Dose, Christian Glaßer:
NP-Completeness, Proof Systems, and Disjoint NP-Pairs. Article TR19-050 - Emanuele Viola:
Pseudorandom bits and lower bounds for randomized Turing machines. Article TR19-051 - Nicola Galesi, Leszek Aleksander Kolodziejczyk, Neil Thapen:
Polynomial calculus space and resolution width. Article TR19-052 - Andrei A. Krokhin, Jakub Oprsal:
The complexity of 3-colouring H-colourable graphs. Article TR19-053 - Joshua Brakensiek, Venkatesan Guruswami:
Bridging between 0/1 and Linear Programming via Random Walks. Article TR19-054 - Kasper Green Larsen, Tal Malkin, Omri Weinstein, Kevin Yeo:
Lower Bounds for Oblivious Near-Neighbor Search. Article TR19-055 - Tom Gur, Oded Lachish:
A Lower Bound for Relaxed Locally Decodable Codes. Article TR19-056 - Olaf Beyersdorff, Joshua Blinkhorn:
Proof Complexity of Symmetry Learning in QBF. Article TR19-057 - Pavel Pudlák, Vojtech Rödl:
Extractors for small zero-fixing sources. Article TR19-058 - Rohit Agrawal:
Samplers and extractors for unbounded functions. Article TR19-059 - Scott Aaronson, Guy N. Rothblum:
Gentle Measurement of Quantum States and Differential Privacy. Article TR19-060 - Scott Aaronson, Daniel Grier, Luke Schaeffer:
A Quantum Query Complexity Trichotomy for Regular Languages. Article TR19-061 - Scott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler:
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. Article TR19-062 - Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Efficient Black-Box Identity Testing for Free Group Algebra. Article TR19-063 - Igor Carboni Oliveira:
Randomness and Intractability in Kolmogorov Complexity. Article TR19-064 - Mrinal Kumar, Ramprasad Saptharishi, Noam Solomon:
Derandomization from Algebraic Hardness: Treading the Borders. Article TR19-065 - Thomas Watson:
A Lower Bound for Sampling Disjoint Sets. Article TR19-066 - Hamed Hatami, Kaave Hosseini, Shachar Lovett:
Sign rank vs Discrepancy. Article TR19-067 - Shuo Pang:
Large Clique is Hard on Average for Resolution. Article TR19-068 - Nicola Galesi, Dmitry Itsykson, Artur Riazanov, Anastasia Sofronova:
Bounded-depth Frege complexity of Tseitin formulas for all graphs. Article TR19-069 - Alessandro Chiesa, Peter Manohar, Igor Shinkar:
On Local Testability in the Non-Signaling Setting. Article TR19-070 - Sumegha Garg, Ran Raz, Avishay Tal:
Time-Space Lower Bounds for Two-Pass Learning. Article TR19-071 - Lijie Chen, Ofer Grossman:
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators. Article TR19-072 - Igor Carboni Oliveira, Rahul Santhanam, Srikanth Srinivasan:
Parity helps to compute Majority. Article TR19-073 - Arka Rai Choudhuri, Pavel Hubácek, Chethan Kamath, Krzysztof Pietrzak, Alon Rosen, Guy N. Rothblum:
Finding a Nash Equilibrium Is No Easier Than Breaking Fiat-Shamir. Article TR19-074 - Lijie Chen, Dylan M. McKay, Cody Murray, R. Ryan Williams:
Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton Theorems. Article TR19-075 - Leroy Chew, Judith Clymo:
The Equivalences of Refutational QRAT. Article TR19-076 - Jan Bydzovsky, Igor Carboni Oliveira, Jan Krajícek:
Consistency of circuit lower bounds with bounded theories. Article TR19-077 - Itai Benjamini, Oded Goldreich:
Pseudo-Mixing Time of Random Walks. Article TR19-078 - Arnab Bhattacharyya, Philips George John, Suprovat Ghoshal, Raghu Meka:
Average Bias and Polynomial Sources. Article TR19-079 - Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas:
On List Recovery of High-Rate Tensor Codes. Article TR19-080 - Iftach Haitner, Noam Mazor, Ronen Shaltiel, Jad Silbak:
Channels of Small Log-Ratio Leakage and Characterization of Two-Party Differentially Private Computation. Article TR19-081 - Andrej Bogdanov, Nikhil S. Mande, Justin Thaler, Christopher Williamson:
Approximate degree, secret sharing, and concentration phenomena. Article TR19-082 - Lior Gishboliner, Asaf Shapira:
Testing Graphs against an Unknown Distribution. Article TR19-083 - Michal Garlík:
Resolution Lower Bounds for Refutation Statements. Article TR19-084 - Xuangui Huang, Emanuele Viola:
Approximate Degree-Weight and Indistinguishability. Article TR19-085 - Alex Bredariol Grilo, William Slofstra, Henry Yuen:
Perfect zero knowledge for quantum multiprover interactive proofs. Article TR19-086 - Rohit Agrawal:
Coin Theorems and the Fourier Expansion. Article TR19-087 - Oded Goldreich:
On the Complexity of Estimating the Effective Support Size. Article TR19-088 - Adam Bene Watts, Robin Kothari, Luke Schaeffer, Avishay Tal:
Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits. Article TR19-089 - Ronen Shaltiel, Swastik Kopparty, Jad Silbak:
Quasilinear time list-decodable codes for space bounded channels. Article TR19-090 - Ryo Ashida, Tatsuya Imai, Kotaro Nakagawa, A. Pavan, N. V. Vinodchandran, Osamu Watanabe:
A Sublinear-space and Polynomial-time Separator Algorithm for Planar Graphs. Article TR19-091 - Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep:
Revisiting Alphabet Reduction in Dinur's PCP. Article TR19-092 - Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari:
Improved 3LIN Hardness via Linear Label Cover. Article TR19-093 - Venkatesan Guruswami, Sai Sandeep:
Rainbow coloring hardness via low sensitivity polymorphisms. Article TR19-094 - Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari:
Unambiguous Catalytic Computation. Article TR19-095 - Aditya Potukuchi:
On the AC0[⊕] complexity of Andreev's Problem. Article TR19-096 - Jacobo Torán, Florian Wörz
:
Reversible Pebble Games and the Relation Between Tree-Like and General Resolution Space. Article TR19-097 - Jayadev Acharya, Clément L. Canonne, Yanjun Han, Ziteng Sun, Himanshu Tyagi:
Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit. Article TR19-098 - Dean Doron, Dana Moshkovitz, Justin Oh, David Zuckerman:
Nearly Optimal Pseudorandomness From Hardness. Article TR19-099 - Hervé Fournier, Guillaume Malod, Maud Szusterman, Sébastien Tavenas:
Nonnegative rank measures and monotone algebraic branching programs. Article TR19-100 - Amit Chakrabarti, Prantar Ghosh:
Streaming Verification of Graph Computations via Graph Structure. Article TR19-101 - Oded Goldreich:
Testing Isomorphism in the Bounded-Degree Graph Model. Article TR19-102 - Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-to-Communication Lifting Using Low-Discrepancy Gadgets. Article TR19-103 - Vishwas Bhargava, Shubhangi Saraf, Ilya Volkovich:
Reconstruction of Depth-$4$ Multilinear Circuits. Article TR19-104 - Ragesh Jaiswal:
A note on the relation between XOR and Selective XOR Lemmas. Article TR19-105 - Noah Fleming, Pravesh Kothari, Toniann Pitassi:
Semialgebraic Proofs and Efficient Algorithm Design. Article TR19-106 - Zachary Remscrim:
The Power of a Single Qubit: Two-way Quantum/Classical Finite Automata and the Word Problem for Linear Groups. Article TR19-107 - Chaoping Xing, Chen Yuan:
Beating the probabilistic lower bound on perfect hashing. Article TR19-108 - Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
Decoding Downset codes over a finite grid. Article TR19-109 - Ryan Alweiss, Shachar Lovett, Kewen Wu, Jiapeng Zhang:
Improved bounds for the sunflower lemma. Article TR19-110 - Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Noisy Beeps. Article TR19-111 - Yotam Dikstein, Irit Dinur:
Agreement testing theorems on layered set systems. Article TR19-112 - Tomer Grossman, Ilan Komargodski, Moni Naor:
Instance Complexity and Unlabeled Certificates in the Decision Tree Model. Article TR19-113 - Visu Makam, Avi Wigderson:
Singular tuples of matrices is not a null cone (and, the symmetries of algebraic varieties). Article TR19-114 - Arnab Bhattacharyya, Édouard Bonnet, László Egri, Suprovat Ghoshal, Karthik C. S., Bingkai Lin, Pasin Manurangsi, Dániel Marx:
Parameterized Intractability of Even Set and Shortest Vector Problem. Article TR19-115 - Venkatesan Guruswami, Sai Sandeep:
$d$-to-$1$ Hardness of Coloring $4$-colorable Graphs with $O(1)$ colors. Article TR19-116 - Silas Richelson, Sourya Roy:
Locally Testable Non-Malleable Codes. Article TR19-117 - Lijie Chen, Ce Jin, Ryan Williams:
Hardness Magnification for all Sparse NP Languages. Article TR19-118 - Dean Doron, Amnon Ta-Shma, Roei Tell:
On Hitting-Set Generators for Polynomials that Vanish Rarely. Article TR19-119 - Or Meir:
Toward Better Depth Lower Bounds: Two Results on the Multiplexor Relation. Article TR19-120 - Alexander A. Sherstov, Justin Thaler:
Vanishing-Error Approximate Degree and QMA Complexity. Article TR19-121 - Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters:
LDPC Codes Achieve List-Decoding Capacity. Article TR19-122 - Pascale Gourdeau, Varun Kanade, Marta Kwiatkowska, James Worrell:
On the Hardness of Robust Classification. Article TR19-123 - Roy Gotlib, Tali Kaufman:
Testing Odd Direct Sums Using High Dimensional Expanders. Article TR19-124 - Elazar Goldenberg, Karthik C. S.:
Hardness Amplification of Optimization Problems. Article TR19-125 - Irit Dinur, Roy Meshulam:
Near Coverings and Cosystolic Expansion - an example of topological property testing. Article TR19-126 - Noga Ron-Zewi, Ron Rothblum:
Local Proofs Approaching the Witness Length. Article TR19-127 - Anna Gál, Robert Robere:
Lower Bounds for (Non-monotone) Comparator Circuits. Article TR19-128 - Zeev Dvir, Allen Liu:
Fourier and Circulant Matrices are Not Rigid. Article TR19-129 - Naomi Kirshner, Alex Samorodnitsky:
A moment ratio bound for polynomials and some extremal properties of Krawchouk polynomials and Hamming spheres. Article TR19-130 - Lieuwe Vinkhuijzen, André H. Deutz:
A Simple Proof of Vyalyi's Theorem and some Generalizations. Article TR19-131 - Klim Efremenko, Gillat Kol, Raghuvansh Saxena:
Radio Network Coding Requires Logarithmic Overhead. Article TR19-132 - Nutan Limaye, Srikanth Srinivasan, Utkarsh Tripathi:
More on $AC^0[\oplus]$ and Variants of the Majority Function. Article TR19-133 - Omri Ben-Eliezer, Clément L. Canonne, Shoham Letzter, Erik Waingarten:
Finding monotone patterns in sublinear time. Article TR19-134 - Michel X. Goemans, Shafi Goldwasser, Dhiraj Holden:
Doubly-Efficient Pseudo-Deterministic Proofs. Article TR19-135 - Sourav Chakraborty, Arkadev Chattopadhyay, Nikhil S. Mande, Manaswi Paraashar:
Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. Article TR19-136 - Shachar Lovett, Kewen Wu, Jiapeng Zhang:
Decision list compression by mild random restrictions. Article TR19-137 - Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
On the Probabilistic Degrees of Symmetric Boolean functions. Article TR19-138 - Irit Dinur, Konstantin Golubev:
Direct sum testing - the general case. Article TR19-139 - Ankit Garg, Visu Makam, Rafael Mendes de Oliveira, Avi Wigderson:
Search problems in algebraic complexity, GCT, and hardness of generator for invariant rings. Article TR19-140 - Mark Braverman, Subhash Khot, Dor Minzer:
On Rich $2$-to-$1$ Games. Article TR19-141 - Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret:
Semi-Algebraic Proofs, IPS Lower Bounds and the $\tau$-Conjecture: Can a Natural Number be Negative? Article TR19-142 - Sivaramakrishnan Natarajan Ramamoorthy, Cyrus Rashtchian:
Equivalence of Systematic Linear Data Structures and Matrix Rigidity. Article TR19-143 - Young Ko, Omri Weinstein:
An Adaptive Step Toward the Multiphase Conjecture. Article TR19-144 - Eshan Chattopadhyay, Pooya Hatami, Kaave Hosseini, Shachar Lovett, David Zuckerman:
XOR Lemmas for Resilient Functions Against Polynomials. Article TR19-145 - Max Bannach, Zacharias Heinrich, Rüdiger Reischuk, Till Tantau:
Dynamic Kernels for Hitting Sets and Set Packing. Article TR19-146 - Gil Cohen, Shahar Samocha:
Capacity-Approaching Deterministic Interactive Coding Schemes Against Adversarial Errors. Article TR19-147 - Amey Bhangale, Subhash Khot:
Simultaneous Max-Cut is harder to approximate than Max-Cut. Article TR19-148 - Dean Doron, Pooya Hatami, William Hoza:
Log-Seed Pseudorandom Generators via Iterated Restrictions. Article TR19-149 - Stanislav Zák:
A Logical Characteristic of Read-Once Branching Programs. Article TR19-150 - Per Austrin, Jonah Brown-Cohen, Johan Håstad:
Optimal Inapproximability with Universal Factor Graphs. Article TR19-151 - Uma Girish, Ran Raz, Avishay Tal:
Quantum versus Randomized Communication Complexity, with Efficient Players. Article TR19-152 - Venkatesan Guruswami, Bernhard Haeupler, Amirbehshad Shahrasbi:
Optimally Resilient Codes for List-Decoding from Insertions and Deletions. Article TR19-153 - Venkatesan Guruswami, Andrii Riazanov, Min Ye:
Ar?kan meets Shannon: Polar codes with near-optimal convergence to channel capacity. Article TR19-154 - Rahul Santhanam:
Pseudorandomness and the Minimum Circuit Size Problem. Article TR19-155 - Nader H. Bshouty:
Almost Optimal Testers for Concise Representations. Article TR19-156 - Leroy Chew, Judith Clymo:
How QBF Expansion Makes Strategy Extraction Hard. Article TR19-157 - Stasys Jukna, Hannes Seiwert:
Sorting Can Exponentially Speed Up Pure Dynamic Programming. Article TR19-158 - Noah Stephens-Davidowitz, Vinod Vaikuntanathan:
SETH-hardness of Coding Problems. Article TR19-159 - Md Lutfar Rahman, Thomas Watson:
Tractable Unordered 3-CNF Games. Article TR19-160 - Suprovat Ghoshal, Rishi Saket:
Hardness of Learning DNFs using Halfspaces. Article TR19-161 - Ran Raz, Wei Zhan:
The Random-Query Model and the Memory-Bounded Coupon Collector. Article TR19-162 - Ramesh Krishnan S. Pallavoor, Sofya Raskhodnikova, Erik Waingarten:
Approximating the Distance to Monotonicity of Boolean Functions. Article TR19-163 - Siddharth Bhandari, Sayantan Chakraborty:
Improved bounds for perfect sampling of $k$-colorings in graphs. Article TR19-164 - Clément L. Canonne, Xi Chen, Gautam Kamath, Amit Levi, Erik Waingarten:
Random Restrictions of High-Dimensional Distributions and Uniformity Testing with Subcube Conditioning. Article TR19-165 - Guy Blanc, Jane Lange, Li-Yang Tan:
Top-down induction of decision trees: rigorous guarantees and inherent limitations. Article TR19-166 - Anant Dhayal, Russell Impagliazzo:
UTIME Easy-witness Lemma & Some Consequences. Article TR19-167 - Igor Carboni Oliveira, Lijie Chen, Shuichi Hirahara, Ján Pich, Ninad Rajgopal, Rahul Santhanam:
Beyond Natural Proofs: Hardness Magnification and Locality. Article TR19-168 - Lijie Chen, Ron Rothblum, Roei Tell, Eylon Yogev:
On Exponential-Time Hypotheses, Derandomization, and Circuit Lower Bounds. Article TR19-169 - Prerona Chatterjee, Mrinal Kumar, Adrian She, Ben Lee Volk:
A Quadratic Lower Bound for Algebraic Branching Programs. Article TR19-170 - Oded Goldreich:
Improved bounds on the AN-complexity of multilinear functions. Article TR19-171 - Prasad Chaugule, Mrinal Kumar, Nutan Limaye, Chandra Kanta Mohapatra, Adrian She, Srikanth Srinivasan:
Schur Polynomials do not have small formulas if the Determinant doesn't! Article TR19-172 - Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, Noah Stephens-Davidowitz:
Extractor Lower Bounds, Revisited. Article TR19-173 - Susanna F. de Rezende, Jakob Nordström, Kilian Risse, Dmitry Sokolov:
Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs. Article TR19-174 - Emanuele Viola:
Matching Smolensky's correlation bound with majority. Article TR19-175 - Gal Arnon, Guy N. Rothblum:
On Prover-Efficient Public-Coin Emulation of Interactive Proofs. Article TR19-176 - Shafi Goldwasser, Ofer Grossman, Sidhanth Mohanty, David P. Woodruff:
Pseudo-deterministic Streaming. Article TR19-177 - Dmitry Itsykson, Artur Riazanov, Danil Sagunov, Petr Smirnov:
Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin Formulas for All Constant-Degree Graphs. Article TR19-178 - Avishay Tal:
Towards Optimal Separations between Quantum and Randomized Query Complexities. Article TR19-179 - Andreas Lenz, Cyrus Rashtchian, Paul H. Siegel, Eitan Yaakobi:
Covering Codes for Insertions and Deletions. Article TR19-180 - Michal Koucký, Vojtech Rödl, Navid Talebanfard:
A Separator Theorem for Hypergraphs and a CSP-SAT Algorithm. Article TR19-181 - Zachary Remscrim:
The Limitations of Few Qubits: One-way and Two-way Quantum Finite Automata and the Group Word Problem. Article TR19-182 - Marshall Ball, Oded Goldreich, Tal Malkin:
Randomness Extraction from Somewhat Dependent Sources. Article TR19-183 - Eshan Chattopadhyay, Jesse Goodman, Vipul Goyal, Xin Li:
Extractors for Adversarial Sources via Extremal Hypergraphs. Article TR19-184 - Greg Bodwin, Ofer Grossman:
Strategy-Stealing is Non-Constructive. Article TR19-185 - Or Meir, Jakob Nordström, Toniann Pitassi, Robert Robere, Susanna F. de Rezende:
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity. Article TR19-186
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-01 23:24 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:
