Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications at "Electron. Colloquium Comput. Complex."( http://dblp.L3S.de/Venues/Electron._Colloquium_Comput._Complex. )

URL (DBLP): http://dblp.uni-trier.de/db/journals/eccc

Publication years (Num. hits)
1994 (27) 1995 (63) 1996 (67) 1997 (61) 1998 (78) 1999 (48) 2000 (91) 2001 (104) 2002 (74) 2003 (87) 2004 (121) 2005 (163) 2006 (160) 2007 (137) 2008 (110) 2009 (147) 2010 (202) 2011 (174) 2012 (186) 2013 (191) 2014 (184) 2015 (208) 2016 (206) 2017 (193) 2018 (213) 2019 (186) 2020 (193) 2021 (182) 2022 (185) 2023 (213) 2024 (58)
Publication types (Num. hits)
article(4312)
Venues (Conferences, Journals, ...)
Electron. Colloquium Comput. C...(4312)
Authors
Oded Goldreich 0001(144) Venkatesan Guruswami(110) Shachar Lovett(85) Madhu Sudan 0001(77) Marek Karpinski(77) Emanuele Viola(71) Ran Raz(68) Avi Wigderson(59) Scott Aaronson(58) Eric Allender(57) Eli Ben-Sasson(55) Salil P. Vadhan(51) Amir Shpilka(50) Irit Dinur(48) Rahul Santhanam(46) Vikraman Arvind(46) More (+10 of total 2404)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 4312 publication records. Showing 4312 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Siddhartha Jain 0002, Jiawei Li, Robert Robere, Zhiyang Xun On Pigeonhole Principles and Ramsey in TFNP. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Changrui Mu, Shafik Nassar, Ron Rothblum, Prashant Nalini Vasudevan Strong Batching for Non-Interactive Statistical Zero-Knowledge. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Omri Shmueli Quantum Algorithms in a Superposition of Spacetimes. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Yotam Dikstein, Irit Dinur, Alexander Lubotzky Low Acceptance Agreement Tests via Bounded-Degree Symplectic HDXs. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Yanyi Liu, Rafael Pass A Direct PRF Construction from Kolmogorov Complexity. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Sreejata Kishor Bhattacharya Aaronson-Ambainis Conjecture Is True For Random Restrictions. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Sam Buss, Neil Thapen A Simple Supercritical Tradeoff between Size and Height in Resolution. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Kuan Cheng, Yichuan Wang $BPL\subseteq L-AC^1$. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Ilario Bonacina, Maria Luisa Bonet, Sam Buss, Massimo Lauria Redundancy for MaxSAT. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Daniel Noble, Brett Hemenway, Rafail Ostrovsky MetaDORAM: Breaking the Log-Overhead Information Theoretic Barrier. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Dmytro Gavinsky Unambiguous parity-query complexity. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Prashanth Amireddy, Amik Raj Behera, Manaswi Paraashar, Srikanth Srinivasan 0001, Madhu Sudan 0001 Local Correction of Linear Functions over the Boolean Cube. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Sreejata Kishor Bhattacharya, Arkadev Chattopadhyay, Pavel Dvorak Exponential Separation Between Powers of Regular and General Resolution Over Parities. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Omkar Baraskar, Agrim Dewan, Chandan Saha 0001 Testing equivalence to design polynomials. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Lisa Jaser, Jacobo Torán Pebble Games and Algebraic Proof Systems Meet Again. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Dor Minzer, Kai Zhe Zheng Near Optimal Alphabet-Soundness Tradeoff PCPs. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Kuan Cheng, Ruiyang Wu Randomness Extractors in $\mathrm{AC}^0$ and $\mathrm{NC}^1$: Optimal up to Constant Factors. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Shuichi Hirahara, Naoto Ohsaka Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Bruno Loff, Alexey Milovanov The hardness of decision tree complexity. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Noam Mazor, Rafael Pass Search-to-Decision Reductions for Kolmogorov Complexity. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Paul Beame, Niels Kornerup Quantum Time-Space Tradeoffs for Matrix Problems. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Xi Chen 0001, Yuhao Li 0002, Mihalis Yannakakis Computing a Fixed Point of Contraction Maps in Polynomial Queries. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Shuichi Hirahara, Nobutaka Shimizu Planted Clique Conjectures Are Equivalent. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Swagato Sanyal Randomized query composition and product distributions. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Huck Bennett, Surendra Ghentiyala, Noah Stephens-Davidowitz The more the merrier! On the complexity of finding multicollisions, with connections to codes and lattices. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Justin Yirka Even quantum advice is unlikely to solve PP. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Karthik C. S., Pasin Manurangsi On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Yaroslav Alekseev, Yuval Filmus, Alexander Smal Lifting dichotomies. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Pavel Hrubes Hard submatrices for non-negative rank and communication complexity }. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Hamed Hatami, Pooya Hatami Structure in Communication Complexity and Constant-Cost Complexity Classes. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Joshua Cook, Dana Moshkovitz Explicit Time and Space Efficient Encoders Exist Only With Random Access. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Noam Mazor, Rafael Pass Gap MCSP is not (Levin) NP-complete in Obfustopia. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Tal Yankovitz A stronger bound for linear 3-LCC. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Mitali Bafna, Noam Lifshitz, Dor Minzer Constant Degree Direct Product Testers with Small Soundness. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Karthik Gajulapalli, Alexander Golovnev, Samuel King On the Power of Adaptivity for Function Inversion. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Oded Goldreich 0001 On the query complexity of testing local graph properties in the bounded-degree graph model. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Sasank Mouli Polynomial Calculus sizes over the Boolean and Fourier bases are incomparable. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Daniel M. Kane, Anthony Ostuni, Kewen Wu 0001 Locality Bounds for Sampling Hamming Slices. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Prasad Chaugule, Nutan Limaye On the closures of monotone algebraic classes and variants of the determinant. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Elette Boyle, Ilan Komargodski, Neekon Vafa Memory Checking Requires Logarithmic Overhead. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Takashi Ishizuka PLS is contained in PLC. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Sam Buss, Emre Yolcu Regular resolution effectively simulates resolution. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Pranav Bisht, Nikhil Gupta 0012, Prajakta Nimbhorkar, Ilya Volkovich Launching Identity Testing into (Bounded) Space. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Noel Arteche, Gaia Carenini, Matthew Gray Quantum Automating $\mathbf{TC}^0$-Frege Is LWE-Hard. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Sabee Grewal, Justin Yirka The Entangled Quantum Polynomial Hierarchy Collapses. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Mason DiCicco, Vladimir Podolskii, Daniel Reichman 0001 Nearest Neighbor Complexity and Boolean Circuits. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Rohit Gurjar, Taihei Oki, Roshan Raj Fractional Linear Matroid Matching is in quasi-NC. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Pavel Hrubes A subquadratic upper bound on sum-of-squares compostion formulas. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Tim Hoffmann, Luc Nicolas Spachmann Proof Complexity of Propositional Model Counting. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Marshall Ball, Yanyi Liu, Noam Mazor, Rafael Pass Kolmogorov Comes to Cryptomania: On Interactive Kolmogorov Complexity and Key-Agreement. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Olaf Beyersdorff, Kaspar Kasche, Luc Nicolas Spachmann Polynomial Calculus for Quantified Boolean Logic: Lower Bounds through Circuits and Degree. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Karthik Gajulapalli, Zeyong Li, Ilya Volkovich Oblivious Classes Revisited: Lower Bounds and Hierarchies. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Oded Goldreich 0001 On locally-characterized expander graphs (a survey). Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Harpreet Bedi Degree 2 lower bound for Permanent in arbitrary characteristic. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Shuichi Hirahara, Naoto Ohsaka Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Mrinal Kumar 0001, Varun Ramanathan 0002, Ramprasad Saptharishi, Ben Lee Volk Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Ashish Dwivedi, Zeyu Guo 0001, Ben Lee Volk Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Noah Fleming, Stefan Grosser, Toniann Pitassi, Robert Robere Black-Box PPP is not Turing-Closed. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2024 DBLP  BibTeX  RDF
1Shai Evra, Shay Gadot, Ohad Klein, Ilan Komargodski Verifying Groups in Linear Time. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Yilei Chen, Jiatu Li Hardness of Range Avoidance and Remote Point for Restricted Circuits via Cryptography. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Andrej Bogdanov, TsunMing Cheung, Krishnamoorthy Dinesh 0001, John C. S. Lui Classical simulation of one-query quantum distinguishers. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Lila Fontes, Sophie Laplante, Mathieu Laurière, Alexandre Nolin The communication complexity of functions with large outputs. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Guy Goldberg Linear Relaxed Locally Decodable and Correctable Codes Do Not Need Adaptivity and Two-Sided Error. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Russell Impagliazzo, Valentine Kabanets, Ilya Volkovich Mutual Empowerment between Circuit Obfuscation and Circuit Minimization. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Oded Goldreich 0001, Laliv Tauber On Testing Group Properties. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Arnab Bhattacharyya 0001, Sutanu Gayen, Kuldeep S. Meel, Dimitrios Myrisiotis, A. Pavan 0001, N. V. Vinodchandran Total Variation Distance Estimation Is as Easy as Probabilistic Inference. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Yuval Filmus, Edward A. Hirsch, Artur Riazanov, Alexander Smal, Marc Vinyals Proving Unsatisfiability with Hitting Formulas. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Jacobo Torán, Florian Wörz Cutting Planes Width and the Complexity of Graph Isomorphism Refutations. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Xin Li 0006 Two Source Extractors for Asymptotically Optimal Entropy, and (Many) More. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Irit Dinur, Siqi Liu, Rachel Yun Zhang New Codes on High Dimensional Expanders. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Marshall Ball, Ronen Shaltiel, Jad Silbak Non-malleable codes with optimal rate for poly-size circuits. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Deepanshu Kush, Shubhangi Saraf Near-Optimal Set-Multilinear Formula Lower Bounds. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Tal Herman, Guy N. Rothblum Doubly-Efficient Interactive Proofs for Distribution Properties. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Omar Alrabiah, Venkatesan Guruswami, Ray Li Randomly punctured Reed-Solomon codes achieve list-decoding capacity over linear-sized fields. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Klim Efremenko, Michal Garlík, Dmitry Itsykson Lower bounds for regular resolution over parities. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Shachar Lovett, Jiapeng Zhang Streaming Lower Bounds and Asymmetric Set-Disjointness. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Chin Ho Lee, Edward Pyne, Salil P. Vadhan On the Power of Regular and Permutation Branching Programs. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Gil Cohen, Tal Yankovitz Asymptotically-Good RLCCs with $(\log{n})^{2+o(1)}$ Queries. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Parker Newton, Silas Richelson, Chase Wilson A High Dimensional Goldreich-Levin Theorem. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Siddharth Iyer, Anup Rao 0001 XOR Lemmas for Communication via Marginal Information. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Per Austrin, Kilian Risse Sum-of-Squares Lower Bounds for the Minimum Circuit Size Problem. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Oded Goldreich 0001 On the Lower Bound on the Length of Relaxed Locally Decodable Codes. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Pooya Hatami, William Hoza Theory of Unconditional Pseudorandom Generators. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Louis Golowich From Grassmannian to Simplicial High-Dimensional Expanders. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Vikraman Arvind, Pushkar S. Joglekar Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1James Cook, Ian Mertz Tree Evaluation is in Space O(log n · log log n). Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Alexander Shekhovtsov, Georgii Zakharov Enumerating Complexity Revisited. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Paul Beame, Niels Kornerup Cumulative Memory Lower Bounds for Randomized and Quantum Computation. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Xue Chen, Kuan Cheng, Xin Li 0006, Songtao Mao Random Shortening of Linear Codes and Application. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Prerona Chatterjee, Anamay Tengse On Annihilators of Explicit Polynomial Maps. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Yanyi Liu, Rafael Pass One-way Functions and Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Sourav Chakraborty 0001, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar, Swagato Sanyal, Nitin Saurabh On the Composition of Randomized Query Complexity and Approximate Degree. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Nir Bitansky, Chethan Kamath, Omer Paneth, Ron Rothblum, Prashant Nalini Vasudevan Batch Proofs are Statistically Hiding. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Mikhail Dektiarev, Nikolai K. Vereshchagin Half-duplex communication complexity with adversary? can be less than the classical communication complexity. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Sagnik Saha, Nikolaj I. Schwartzbach, Prashant Nalini Vasudevan The Planted $k$-SUM Problem: Algorithms, Lower Bounds, Hardness Amplification, and Cryptography. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Benny Applebaum, Oded Nir Advisor-Verifier-Prover Games and the Hardness of Information Theoretic Cryptography. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Edward Pyne, Ran Raz, Wei Zhan Certified Hardness vs. Randomness for Log-Space. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Klim Efremenko, Gillat Kol, Dmitry Paramonov, Raghuvansh Saxena Protecting Single-Hop Radio Networks from Message Drops. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Prerona Chatterjee, Pavel Hrubes New Lower Bounds against Homogeneous Non-Commutative Circuits. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
1Vinayak M. Kumar, Geoffrey Mon Relaxed Local Correctability from Local Testing. Search on Bibsonomy Electron. Colloquium Comput. Complex. The full citation details ... 2023 DBLP  BibTeX  RDF
Displaying result #1 - #100 of 4312 (100 per page; Change: )
Pages: [1][2][3][4][5][6][7][8][9][10][>>]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license