Výsledky vyhledávání - "Theory of computation → Computational complexity and cryptography"
-
1
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.science/hal-04539439 ; 2025.
Témata: 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]
-
2
Autoři: a další
Přispěvatelé: a další
Zdroj: 35th Computational Complexity Conference
Témata: 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
Popis souboru: application/pdf
Přístupová URL adresa: 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 -
3
Autoři:
Zdroj: Journal of Information Security. 14:366-395
Témata: FOS: Computer and information sciences, Computer Science - Cryptography and Security, Rings and Algebras (math.RA), FOS: Mathematics, 0202 electrical engineering, electronic engineering, information engineering, Mathematics - Rings and Algebras, 0102 computer and information sciences, 02 engineering and technology, Cryptography and Security (cs.CR), Security and privacy - Cryptography and other attacks, Theory of computation - Computational complexity and cryptography, 01 natural sciences
Přístupová URL adresa: http://arxiv.org/abs/2301.12060
-
4
Autoři: a další
Přispěvatelé: a další
Témata: 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
Přístupová URL adresa: https://hal.science/hal-04859229v1
-
5
Autoři: a další
Přispěvatelé: a další
Zdroj: https://hal.science/hal-04539439 ; 2024.
Témata: 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]
-
6
Autoři: a další
Přispěvatelé: a další
Témata: 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
Popis souboru: application/pdf
-
7
Autoři: a další
Přispěvatelé: a další
Témata: 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
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.32
-
8
Autoři: a další
Přispěvatelé: a další
Témata: 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
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITC.2022.12
-
9
Autoři: a další
Přispěvatelé: a další
Zdroj: 2nd Conference on Information-Theoretic Cryptography (ITC 2021)
Témata: Theory of computation → Interactive proof systems, Computational complexity, Cryptography, Interactive Proofs, ddc:004, Theory of computation → Computational complexity and cryptography
Popis souboru: application/pdf
-
10
Autoři: a další
Zdroj: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. :483-496
Témata: 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
Přístupová URL adresa: 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 -
11
Autoři:
Témata: 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
-
12
Autoři: a další
Přispěvatelé: a další
Zdroj: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, {APPROX/RANDOM} 2021, August 16-18, 2021, University of Washington, Seattle, Washington, {USA} (Virtual Conference)
Témata: 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
Popis souboru: application/pdf
Přístupová URL adresa: 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 -
13
Autoři: a další
Přispěvatelé: a další
Témata: Sensitivity, Polynomial Degree, Boolean Functions, ddc:004, Theory of computation → Computational complexity and cryptography
Popis souboru: application/pdf
Přístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2020.62
Nájsť tento článok vo Web of Science 
Full Text Finder