-
1Report
Authors: Zheng, Zhiyong, Liu, Fengxia, Tian, Kun
Subject Terms: Computer Science - Cryptography and Security, Mathematics - Rings and Algebras, Security and privacy - Cryptography and other attacks, Theory of computation - Computational complexity and cryptography
Access URL: http://arxiv.org/abs/2301.12060
-
2Report
Authors: Léchine, Ulysse, Seiller, Thomas
Contributors: Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Université Sorbonne Paris Nord, Centre National de la Recherche Scientifique (CNRS), ANR-22-CE48-0003,DySCo,Systèmes Dynamiques et Calcul: une approche logique(2022)
Source: https://hal.science/hal-04539439 ; 2025.
Subject Terms: Kolmogorov Complexity, Complexity theory, time bounded kolmogorov complexity, Parallel computing, Combinatorics, CCS Concepts: Theory of computation → Computational complexity and cryptography, Mathematics of computing → Discrete mathematics Kolmogorov Complexity, Time hierarchy, Combinatorial game, CCS Concepts, Theory of computation → Computational complexity and cryptography, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO]Computer Science [cs], [MATH]Mathematics [math], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
-
3Academic Journal
Authors: Filmus, Yuval, Ishai, Yuval, Kaplan, Avi, Kindler, Guy
Contributors: Yuval Filmus and Yuval Ishai and Avi Kaplan and Guy Kindler, Shubhangi Saraf
Source: 35th Computational Complexity Conference
Subject Terms: Theory of computation → Communication complexity, IPPP, 4. Education, 16. Peace & justice, simultaneous messages, 7. Clean energy, communication complexity, ddc:004, preprocessing, Theory of computation → Computational complexity and cryptography, circuit, Theory of computation → Circuit complexity, PRF
File Description: application/pdf
Access URL: https://dl.acm.org/doi/10.4230/LIPIcs.CCC.2020.17
https://dblp.uni-trier.de/db/conf/coco/coco2020.html#FilmusIKK20
https://doi.org/10.4230/LIPIcs.CCC.2020.17
https://drops.dagstuhl.de/opus/volltexte/2020/12569/pdf/LIPIcs-CCC-2020-17.pdf/
https://drops.dagstuhl.de/opus/volltexte/2020/12569/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2020.17 -
4Conference
Contributors: Kanté, Mamadou
Subject Terms: Theory of computation → Models of computation, Mathematics of computing → Graph theory, STACS 2024, Theory of computation → Design and analysis of algorithms, Theory of computation → Formal languages and automata theory, Complete Volume, [INFO] Computer Science [cs], Volume 289, Theory of computation → Computational complexity and cryptography, Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs
Access URL: https://hal.science/hal-04859229v1
-
5Academic Journal
Authors: Hecher, Markusj_itit-2023-0004_aff_001
Source: it - Information Technology. 65(1-2):65-73
-
6Report
Authors: Léchine, Ulysse, Seiller, Thomas
Contributors: Laboratoire d'Informatique de Paris-Nord (LIPN), Centre National de la Recherche Scientifique (CNRS)-Université Sorbonne Paris Nord, Université Sorbonne Paris Nord, Centre National de la Recherche Scientifique (CNRS), ANR-22-CE48-0003,DySCo,Systèmes Dynamiques et Calcul: une approche logique(2022)
Source: https://hal.science/hal-04539439 ; 2024.
Subject Terms: Kolmogorov Complexity, Complexity theory, time bounded kolmogorov complexity, Parallel computing, Combinatorics, CCS Concepts: Theory of computation → Computational complexity and cryptography, Mathematics of computing → Discrete mathematics Kolmogorov Complexity, Time hierarchy, Combinatorial game, CCS Concepts, Theory of computation → Computational complexity and cryptography, [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC], [INFO]Computer Science [cs], [MATH]Mathematics [math], [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
-
7Conference
Contributors: Petra Berenbrink and Patricia Bouyer and Anuj Dawar and Mamadou Moustapha Kanté, Kanté, Mamadou
Subject Terms: Theory of computation → Models of computation, Mathematics of computing → Graph theory, Theory of computation → Formal languages and automata theory, Theory of computation → Design and analysis of algorithms, [INFO] Computer Science [cs], Mathematics of computing → Combinatorics, Theory of computation → Logic, LIPIcs, Volume 254, STACS 2023, Complete Volume, STACS 2023, Complete Volume, ddc:004, Theory of computation → Computational complexity and cryptography, Volume 254, LIPIcs
File Description: application/pdf
-
8Conference
Contributors: Sourav Chakraborty and Anna Gál and Sophie Laplante and Rajat Mittal and Anupa Sunny, Magniez, Frédéric
Subject Terms: certificate complexity, zero-communication two-player games, boolean function complexity, block sensitivity, Theory of computation → Quantum query complexity, query complexity, [INFO] Computer Science [cs], ddc:004, sensitivity, Theory of computation → Computational complexity and cryptography, Theory of computation → Circuit complexity
File Description: application/pdf
-
9Conference
Authors: Rotem, Lior, Segev, Gil
Contributors: Lior Rotem and Gil Segev, Dachman-Soled, Dana
Subject Terms: Discrete logarithm, Security and privacy → Mathematical foundations of cryptography, Security and privacy → Information-theoretic techniques, ddc:004, Theory of computation → Computational complexity and cryptography, Preprocessing
File Description: application/pdf
-
10Academic Journal
Authors: Arnon, Gal, Rothblum, Guy N.
Contributors: Gal Arnon and Guy N. Rothblum, Tessaro, Stefano
Source: 2nd Conference on Information-Theoretic Cryptography (ITC 2021)
Subject Terms: Theory of computation → Interactive proof systems, Computational complexity, Cryptography, Interactive Proofs, ddc:004, Theory of computation → Computational complexity and cryptography
File Description: application/pdf
-
11Academic Journal
Source: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. :483-496
Subject Terms: 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, THEORY OF COMPUTATION, COMPUTATIONAL COMPLEXITY AND CRYPTOGRAPHY, COMPLEXITY CLASSES, COMPLEXITY THEORY AND LOGIC, CRYPTOGRAPHIC PRIMITIVES, PROBLEMS, REDUCTIONS AND COMPLETENESS
Access URL: http://dl.acm.org/ft_gateway.cfm?id=3055466&type=pdf
https://dl.acm.org/doi/pdf/10.1145/3055399.3055466
https://doi.org/10.1145/3055399.3055466
https://dblp.uni-trier.de/db/conf/stoc/stoc2017.html#BallRSV17
https://dl.acm.org/ft_gateway.cfm?id=3055466&type=pdf
https://dl.acm.org/doi/10.1145/3055399.3055466
https://hdl.handle.net/11565/4073360
https://doi.org/10.1145/3055399.3055466 -
12Conference
Subject Terms: info:eu-repo/classification/ddc, Smoothed Analysis, local search, better-response dynamics, PLS-hardness, combinatorial local optimization, congestion games, pure Nash equilibria, Theory of computation → Algorithmic game theory, Mathematics of computing → Combinatorial optimization, Theory of computation → Computational complexity and cryptography
Relation: https://mediatum.ub.tum.de/1748727
-
13Academic Journal
Contributors: Zvika Brakerski and Noah Stephens-Davidowitz and Vinod Vaikuntanathan, Wootters, Mary, Sanità, Laura
Source: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University of Washington, Seattle, Washington, {USA} (Virtual Conference)
Subject Terms: FOS: Computer and information sciences, k-SUM, 0211 other engineering and technologies, average-case hardness, 0102 computer and information sciences, 02 engineering and technology, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, fine-grained complexity, Computer Science - Data Structures and Algorithms, Data Structures and Algorithms (cs.DS), ddc:004, Theory of computation → Computational complexity and cryptography
File Description: application/pdf
Access URL: http://arxiv.org/abs/2010.08821
https://drops.dagstuhl.de/opus/volltexte/2021/14722/
https://dblp.uni-trier.de/db/journals/corr/corr2010.html#abs-2010-08821
https://drops.dagstuhl.de/opus/volltexte/2021/14722/pdf/LIPIcs-APPROX29.pdf/
https://arxiv.org/pdf/2010.08821
https://arxiv.org/abs/2010.08821
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2021.29 -
14Conference
Authors: Laplante, Sophie, Naserasr, Reza, Sunny, Anupa
Contributors: Sophie Laplante and Reza Naserasr and Anupa Sunny, Javier Esparza, Daniel Kráľ
Subject Terms: Sensitivity, Polynomial Degree, Boolean Functions, ddc:004, Theory of computation → Computational complexity and cryptography
File Description: application/pdf