Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
135 | Nian-Feng Tzeng, Po-Jen Chuang |
A Pairwise Substitutional Fault Tolerance Technique for the Cube-Connected Cycles Architecture. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 5(4), pp. 433-438, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
cube-connected cycles architecture, CCC, fault-tolerant CCC structure, fault-tolerantstructure, fault tolerance, VLSI, fault tolerant computing, reconfiguration, multiprocessor interconnection networks, VLSI layout, reliability analysis, performance degradation, layout area |
83 | Christoph Lüth, Markus Roggenbach, Lutz Schröder |
CCC - The Casl Consistency Checker. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WADT ![In: Recent Trends in Algebraic Development Techniques, 17th International Workshop, WADT 2004, Barcelona, Spain, March 27-29, 2004, Revised Selected Papers, pp. 94-105, 2004, Springer, 3-540-25327-0. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
75 | Istehad Chowdhury, Mohammad Zulkernine |
Can complexity, coupling, and cohesion metrics be used as early indicators of vulnerabilities? ![Search on Bibsonomy](Pics/bibsonomy.png) |
SAC ![In: Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), Sierre, Switzerland, March 22-26, 2010, pp. 1963-1969, 2010, ACM, 978-1-60558-639-7. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
security, complexity, empirical study, software metrics, coupling, vulnerability, software security, cohesion |
68 | Bhaskar P. Deosarkar, Narendra Singh Yadav, Rajendra Prasad Yadav |
Chain based Conical Clustering (CCC) framework for data gathering in WSNs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICON ![In: Proceedings of the 16th International Conference on Networks, ICON 2008, December 12-14, 2008, held at India Habitat Centre, New Delhi, India, pp. 1-6, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
67 | Andrzej Roslanowski, Saharon Shelah |
Sweet & sour and other flavours of ccc forcing notions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 43(5), pp. 583-664, 2004. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Definable forcing notions, Forcing with norms, Strong ccc properties |
60 | Yogesh Reddy Kondareddy, Prathima Agrawal |
Synchronized MAC Protocol For Multi-Hop Cognitive Radio Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICC ![In: Proceedings of IEEE International Conference on Communications, ICC 2008, Beijing, China, 19-23 May 2008, pp. 3198-3202, 2008, IEEE. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
60 | Mingyuan Yu, Xianping Huang, Li Jiang, Ronghua Liang |
Combined Public Key Cryptosystem Based on Conic Curves over the Ring Zn. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSSE (3) ![In: International Conference on Computer Science and Software Engineering, CSSE 2008, Volume 3: Grid Computing / Distributed and Parallel Computing / Information Security, December 12-14, 2008, Wuhan, China, pp. 631-634, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
60 | Ying-Hong Wang, Chin-Yung Yu, Ping-Fang Fu |
A Coverage and Connectivity Method to Cluster Topology in Wireless Sensor Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AINA Workshops (1) ![In: 21st International Conference on Advanced Information Networking and Applications (AINA 2007), Workshops Proceedings, Volume 1, May 21-23, 2007, Niagara Falls, Canada, pp. 97-102, 2007, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
60 | Yunhong Gu, Robert L. Grossman |
Supporting Configurable Congestion Control in Data Transport Services. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SC ![In: Proceedings of the ACM/IEEE SC2005 Conference on High Performance Networking and Computing, November 12-18, 2005, Seattle, WA, USA, CD-Rom, pp. 31, 2005, IEEE Computer Society, 1-59593-061-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
60 | Guihai Chen, Francis C. M. Lau 0001 |
Tighter Layouts of the Cube-Connected Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 11(2), pp. 182-191, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
routing, VLSI, Interconnection networks, embedding, layout, cube-connected cycles |
60 | Angkul Kongmunvattana, Santipong Tanchatchawal, Nian-Feng Tzeng |
Coherence-based Coordinated Checkpointing for Software Distributed Shared Memory Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICDCS ![In: Proceedings of the 20th International Conference on Distributed Computing Systems, Taipei, Taiwan, April 10-13, 2000, pp. 556-563, 2000, IEEE Computer Society, 0-7695-0601-1. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
60 | Dikran S. Meliksetian, C. Y. Roger Chen |
Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 4(10), pp. 1172-1178, 1993. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
multiprocessor structure, exact network diameter, fault tolerant computing, hypercube networks, diameter, cube-connected cycles, performanceevaluation, optimal routing algorithm |
53 | Emanuele Viola |
On Constructing Parallel Pseudorandom Generators from One-Way Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA, pp. 183-197, 2005, IEEE Computer Society, 0-7695-2364-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Pseudorandom generator construction, one-way function, black-box, restriction, constant-depth circuit, noise sensitivity, hardness amplification |
53 | Thomas Fang Zheng, Zhanjiang Song, Lihong Zhang, Michael Brasser, Wei Wu, Jing Deng |
CCC Speaker Recognition Evaluation 2006: Overview, Methods, Data, Results and Perspective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISCSLP ![In: Chinese Spoken Language Processing, 5th International Symposium, ISCSLP 2006, Singapore, December 13-16, 2006, Proceedings, pp. 485-493, 2006, Springer, 3-540-49665-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Evaluation, Speaker recognition |
53 | Yasunori Harada, Kenichi Yamazaki, Richard Potter |
CCC: User-Defined Object Structure in C. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECOOP ![In: ECOOP 2001 - Object-Oriented Programming, 15th European Conference, Budapest, Hungary, June 18-22, 2001, Proceedings, pp. 118-129, 2001, Springer, 3-540-42206-4. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP DOI BibTeX RDF |
|
45 | Massimo Strano, Carlos Molina-Jiménez, Santosh K. Shrivastava |
Implementing a Rule-Based Contract Compliance Checker. ![Search on Bibsonomy](Pics/bibsonomy.png) |
I3E ![In: Software Services for e-Business and e-Society, 9th IFIP WG 6.1 Conference on e-Business, e-Services and e-Society, I3E 2009, Nancy, France, September 23-25, 2009. Proceedings, pp. 96-111, 2009, Springer, 978-3-642-04279-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
45 | Sang-Woon Kim, Robert P. W. Duin |
A Combine-Correct-Combine Scheme for Optimizing Dissimilarity-Based Classifiers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CIARP ![In: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, 14th Iberoamerican Conference on Pattern Recognition, CIARP 2009, Guadalajara, Jalisco, Mexico, November 15-18, 2009. Proceedings, pp. 425-432, 2009, Springer, 978-3-642-10267-7. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
|
45 | Xiao Wu 0001, Chong-Wah Ngo, Alexander G. Hauptmann |
Multimodal News Story Clustering With Pairwise Visual Near-Duplicate Constraint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Multim. ![In: IEEE Trans. Multim. 10(2), pp. 188-199, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
45 | Benny Chor, Michael R. Fellows, Mark A. Ragan, Igor Razgon, Frances A. Rosamond, Sagi Snir |
Connected Coloring Completion for General Graphs: Algorithms and Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COCOON ![In: Computing and Combinatorics, 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007, Proceedings, pp. 75-85, 2007, Springer, 978-3-540-73544-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Topics Algorithms and Complexity, Bioinformatics |
45 | Mohammad Amin Dallaali, Malin Premaratne |
Controlled Content Crossover: A New Crossover Scheme and Its Application to Optical Network Component Allocation Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
GECCO (2) ![In: Genetic and Evolutionary Computation - GECCO 2004, Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26-30, 2004, Proceedings, Part II, pp. 387-389, 2004, Springer, 3-540-22343-6. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
45 | Y. Pu, Daniel Andresen |
Distributed Processing for Cinematic Holographic Particle Image Velocimetry. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HPDC ![In: Proceedings of the Eighth IEEE International Symposium on High Performance Distributed Computing, HPDC'99, Redondo Beach, California, USA, August 3-6, 1999., pp. 343-344, 1999, IEEE Computer Society, 0-7695-0287-3. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
45 | Ralf Klasing |
Improved Compressions of Cube-Connected Cycles Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Parallel Distributed Syst. ![In: IEEE Trans. Parallel Distributed Syst. 9(8), pp. 803-812, 1998. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
cube-connected cycles network, Parallel computations, interconnection networks, parallel architectures, network simulation, graph embedding |
45 | Ralf Klasing |
Improved Compressions of Cube-Connected Cycles Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
WG ![In: Graph-Theoretic Concepts in Computer Science, 24th International Workshop, WG '98, Smolenice Castle, Slovak Republic, June 18-20, 1998, Proceedings, pp. 242-256, 1998, Springer, 3-540-65195-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
45 | Gaétan Hains, John Mullins |
Array Structures and Data-Parallel Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Euro-Par, Vol. II ![In: Euro-Par '96 Parallel Processing, Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings, Volume II, pp. 409-416, 1996, Springer, 3-540-61627-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
|
45 | Isaac Yi-Yuan Lee, Sheng-De Wang |
Ring-Connected Hypercubes and Their Relationship to Cubical Ring Connected Cycles and Dynamic Redundancy Networks. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the ACM 21th Conference on Computer Science, CSC '93, Indianapolis, IN, USA, February 16-18, 1993, pp. 137-142, 1993, ACM, 0-89791-558-5. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
45 | Graham Campbell 0002, Thomas A. DeFanti, Jeff Frederiksen, Stephen A. Joyce, Lawrence A. Leske |
Two bit/pixel full color encoding. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SIGGRAPH ![In: Proceedings of the 13th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1986, Dallas, Texas, USA, August 18-22, 1986, pp. 215-223, 1986, ACM, 0-89791-196-2. The full citation details ...](Pics/full.jpeg) |
1986 |
DBLP DOI BibTeX RDF |
|
45 | Pierre-Louis Curien |
Typed Categorial Combinatory Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TAPSOFT, Vol.1 ![In: Mathematical Foundations of Software Development, Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, Germany, March 25-29, 1985, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'85), pp. 157-172, 1985, Springer, 3-540-15198-2. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
45 | Hiroyuki Sato |
E-CCC: Between CCC and Topos. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Theor. Comput. Sci. ![In: Theor. Comput. Sci. 64(1), pp. 55-66, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
45 | Hiroyuki Sato |
E-CCC: Between CCC and Topos, - its Expressive Power from the Viewpoint of Data Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Symb. Comput. ![In: J. Symb. Comput. 8(6), pp. 681-695, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
|
44 | HyeongRag Kim, Hoon-Jae Lee 0001, Sang-Jae Moon |
A Security Enhancement of the E0 Cipher in Bluetooth System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
KES-AMSTA ![In: Agent and Multi-Agent Systems: Technologies and Applications, Second KES International Symposium, KES-AMSTA 2008, Incheon, Korea, March 26-28, 2008. Proceedings, pp. 858-867, 2008, Springer, 978-3-540-78581-1. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
CCC-SG, Stream cipher, Cryptosystem |
38 | Amnon Ta-Shma (eds.) |
38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2 The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP BibTeX RDF |
|
38 | |
Front Matter, Table of Contents, Preface, Conference Organization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 0:1-0:14, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Deepanshu Kush, Shubhangi Saraf |
Near-Optimal Set-Multilinear Formula Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 15:1-15:33, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Per Austrin, Kilian Risse |
Sum-Of-Squares Lower Bounds for the Minimum Circuit Size Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 31:1-31:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Prerona Chatterjee, Pavel Hrubes |
New Lower Bounds Against Homogeneous Non-Commutative Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 13:1-13:10, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Gil Cohen, Itay Cohen 0003 |
Spectral Expanding Expanders. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 8:1-8:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Alexander R. Block, Jeremiah Blocki, Kuan Cheng, Elena Grigorescu, Xin Li 0006, Yu Zheng 0014, Minshen Zhu |
On Relaxed Locally Decodable Codes for Hamming and Insertion-Deletion Errors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 14:1-14:25, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Yanyi Liu, Rafael Pass |
Leakage-Resilient Hardness vs Randomness. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 32:1-32:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Andris Ambainis, Aleksandrs Belovs |
An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 24:1-24:13, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Dieter van Melkebeek, Nicollas M. Sdroievski |
Instance-Wise Hardness Versus Randomness Tradeoffs for Arthur-Merlin Protocols. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 17:1-17:36, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Srinivasan Arunachalam, Uma Girish |
Trade-Offs Between Entanglement and Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 25:1-25:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Dmitriy Kunisky, Xifan Yu |
A Degree 4 Sum-Of-Squares Lower Bound for the Clique Number of the Paley Graph. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 30:1-30:25, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Peter Ivanov, Liam Pavlovic, Emanuele Viola |
On Correlation Bounds Against Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 3:1-3:35, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Nicola Galesi, Joshua A. Grochow, Toniann Pitassi, Adrian She |
On the Algebraic Proof Complexity of Tensor Isomorphism. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 4:1-4:40, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Russell Impagliazzo, Sasank Mouli, Toniann Pitassi |
Lower Bounds for Polynomial Calculus with Extension Variables over Finite Fields. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 7:1-7:24, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Bruno Pasqualotto Cavalar, Igor C. Oliveira |
Constant-Depth Circuits vs. Monotone Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 29:1-29:37, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Nai-Hui Chia, Kai-Min Chung, Yao-Ching Hsieh, Han-Hsuan Lin, Yao-Ting Lin, Yu-Ching Shen |
On the Impossibility of General Parallel Fast-Forwarding of Hamiltonian Simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 33:1-33:45, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Tommaso d'Orsi, Luca Trevisan |
A Ihara-Bass Formula for Non-Boolean Matrices and Strong Refutations of Random CSPs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 27:1-27:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Dorna Abdolazimi, Shayan Oveis Gharan |
An Improved Trickle down Theorem for Partite Complexes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 10:1-10:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Anand Natarajan, Chinmay Nirkhe |
A Distribution Testing Oracle Separating QMA and QCMA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 22:1-22:27, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Hervé Fournier, Nutan Limaye, Guillaume Malod, Srikanth Srinivasan 0001, Sébastien Tavenas |
Towards Optimal Depth-Reductions for Algebraic Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 28:1-28:19, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Vinayak M. Kumar |
Tight Correlation Bounds for Circuits Between AC0 and TC0. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 18:1-18:40, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Dean Doron, Roei Tell |
Derandomization with Minimal Memory Footprint. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 11:1-11:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Rahul Santhanam |
An Algorithmic Approach to Uniform Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 35:1-35:26, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Xi Chen 0001, Yuhao Li 0002, Mihalis Yannakakis |
Reducing Tarski to Unique Tarski (In the Black-Box Model). ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 21:1-21:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Dorit Aharonov, Sandy Irani |
Translationally Invariant Constraint Optimization Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 23:1-23:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Emanuele Viola |
New Sampling Lower Bounds via the Separator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 26:1-26:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Lunjia Hu, Inbal Livni Navon, Omer Reingold |
Generative Models of Huge Objects. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 5:1-5:20, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Shuichi Hirahara, Zhenjian Lu, Hanlin Ren |
Bounded Relativization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 6:1-6:45, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar |
Criticality of AC⁰-Formulae. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 19:1-19:24, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Tsun-Ming Cheung, Hamed Hatami, Kaave Hosseini, Morgan Shirley |
Separation of the Factorization Norm and Randomized Communication Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 1:1-1:16, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Josh Alman, Jaroslaw Blasiok |
Matrix Multiplication and Number on the Forehead Communication. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 16:1-16:23, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Abhranil Chatterjee 0001, Sumanta Ghosh, Rohit Gurjar, Roshan Raj |
Border Complexity of Symbolic Determinant Under Rank One Restriction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 2:1-2:15, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Abhibhav Garg, Rafael Oliveira 0006, Shir Peleg, Akash Kumar Sengupta |
Radical Sylvester-Gallai Theorem for Tuples of Quadratics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 20:1-20:30, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Eshan Chattopadhyay, Jyun-Jie Liao |
Hardness Against Linear Branching Programs and More. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 9:1-9:27, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Ben Davis, Robert Robere |
Colourful TFNP and Propositional Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 36:1-36:21, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Halley Goldberg, Valentine Kabanets |
Improved Learning from Kolmogorov Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 12:1-12:29, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Lennart Bittel, Sevag Gharibian, Martin Kliesch |
The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK, pp. 34:1-34:24, 2023, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-282-2. The full citation details ...](Pics/full.jpeg) |
2023 |
DBLP DOI BibTeX RDF |
|
38 | Shachar Lovett (eds.) |
37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9 The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP BibTeX RDF |
|
38 | Michael E. Saks, Rahul Santhanam |
On Randomized Reductions to the Random Strings. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 29:1-29:30, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Dan Karliner, Roie Salama, Amnon Ta-Shma |
The Plane Test Is a Local Tester for Multiplicity Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 14:1-14:33, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Shuichi Hirahara |
Symmetry of Information from Meta-Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 26:1-26:41, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Svyatoslav Gryaznov, Pavel Pudlák, Navid Talebanfard |
Linear Branching Programs and Directional Affine Extractors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 4:1-4:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Zander Kelley, Raghu Meka |
Random Restrictions and PRGs for PTFs in Gaussian Space. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 21:1-21:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Lijie Chen 0001, Jiatu Li, Tianqi Yang 0001 |
Extremely Efficient Constructions of Hash Functions, with Applications to Hardness Magnification and PRFs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 23:1-23:37, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Scott Aaronson, DeVon Ingram, William Kretschmer |
The Acrobatics of BQP. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 20:1-20:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Nutan Limaye, Srikanth Srinivasan 0001, Sébastien Tavenas |
On the Partial Derivative Method Applied to Lopsided Set-Multilinear Polynomials. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 32:1-32:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Guy Blanc, Dean Doron |
New Near-Linear Time Decodable Codes Closer to the GV Bound. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 10:1-10:40, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Karthik C. S., Subhash Khot |
Almost Polynomial Factor Inapproximability for Parameterized k-Clique. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 6:1-6:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Deepanshu Kush, Shubhangi Saraf |
Improved Low-Depth Set-Multilinear Circuit Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 38:1-38:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Yanyi Liu, Rafael Pass |
On One-Way Functions from NP-Complete Problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 36:1-36:24, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Till Tantau |
On the Satisfaction Probability of k-CNF Formulas. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 2:1-2:27, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Venkatesan Guruswami, Peter Manohar, Jonathan Mosheiff |
ℓp-Spread and Restricted Isometry Properties of Sparse Random Matrices. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 7:1-7:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Xin Lyu 0002 |
Improved Pseudorandom Generators for AC⁰ Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 34:1-34:25, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Gal Arnon, Alessandro Chiesa, Eylon Yogev |
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 24:1-24:16, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Yanyi Liu, Rafael Pass |
Characterizing Derandomization Through Hardness of Levin-Kolmogorov Complexity. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 35:1-35:17, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Nikhil Bansal 0001, Makrand Sinha, Ronald de Wolf |
Influence in Completely Bounded Block-Multilinear Forms and Classical Simulation of Quantum Algorithms. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 28:1-28:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | James Cook, Ian Mertz |
Trading Time and Space in Catalytic Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 8:1-8:21, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Sandy Irani, Anand Natarajan, Chinmay Nirkhe, Sujit Rao, Henry Yuen |
Quantum Search-To-Decision Reductions and the State Synthesis Problem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 5:1-5:19, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Harm Derksen, Visu Makam, Jeroen Zuiddam |
Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 9:1-9:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Andrej Bogdanov, William M. Hoza, Gautam Prakriya, Edward Pyne |
Hitting Sets for Regular Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 3:1-3:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Louis Golowich, Salil P. Vadhan |
Pseudorandomness of Expander Random Walks for Symmetric Functions and Permutation Branching Programs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 27:1-27:13, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan 0001 |
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 31:1-31:14, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Ivan Mihajlin, Anastasia Sofronova |
A Better-Than-3log(n) Depth Lower Bound for De Morgan Formulas with Restrictions on Top Gates. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 13:1-13:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Dmitry Sokolov 0001 |
Pseudorandom Generators, Resolution and Heavy Width. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 15:1-15:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Sarah Bordage, Mathieu Lhotel, Jade Nardi, Hugues Randriam |
Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 30:1-30:45, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Ryan O'Donnell, Kevin Pratt |
High-Dimensional Expanders from Chevalley Groups. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 18:1-18:26, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Vikraman Arvind, Pushkar S. Joglekar |
On Efficient Noncommutative Polynomial Factorization via Higman Linearization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 12:1-12:22, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Erfan Khaniki |
Nisan-Wigderson Generators in Proof Complexity: New Lower Bounds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 17:1-17:15, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|
38 | Amol Aggarwal, Josh Alman |
Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CCC ![In: 37th Computational Complexity Conference, CCC 2022, July 20-23, 2022, Philadelphia, PA, USA., pp. 22:1-22:23, 2022, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 978-3-95977-241-9. The full citation details ...](Pics/full.jpeg) |
2022 |
DBLP DOI BibTeX RDF |
|