Search Results - "Computational complexity and cryptography"
-
1
Contributors: et al.
Subject Terms: Open Access, Computational complexity and cryptography, Robustness, Human computer interaction (HCI), Data management systems, Architectures, Systems security, Government technology policy, Law, social and behavioral sciences, Coding theory and cryptology, Data encryption, Artificial intelligence, Network security, Network hardware
File Description: application/pdf
Relation: Lecture Notes in Computer Science; Computer Science; Computer Science (R0)
-
2
Authors: et al.
Contributors: et al.
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]
-
3
Contributors: et al.
Subject Terms: architecture verification and validation, artificial intelligence, design and analysis of algorithms, computational complexity and cryptography, embedded systems, model checking, formal methods, formal logic, machine learning, formal languages and automata theory, models of computation, semantics and reasoning, software engineering, theory and algorithms for application domains, Software Engineering, Mathematical theory of computation, Expert systems / knowledge-based systems, Programming and scripting languages: general, Computer hardware, Natural language and machine translation
File Description: application/pdf
Relation: Lecture Notes in Computer Science
-
4
Authors: et al.
Contributors: et al.
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 -
5
Authors:
Source: Journal of Information Security. 14:366-395
Subject Terms: 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
Access URL: http://arxiv.org/abs/2301.12060
-
6
Authors: et al.
Contributors: et al.
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
-
7
Authors: et al.
Contributors: et al.
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]
-
8
Authors: et al.
Contributors: et al.
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
-
9
Authors: et al.
Contributors: et al.
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
-
10
Authors: et al.
Contributors: et al.
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
-
11
Authors: et al.
Contributors: et al.
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
-
12
Authors: et al.
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 -
13
Authors:
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
-
14
Authors: et al.
Contributors: et al.
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 -
15
Authors: et al.
Contributors: et al.
Subject Terms: Sensitivity, Polynomial Degree, Boolean Functions, ddc:004, Theory of computation → Computational complexity and cryptography
File Description: application/pdf
-
16
Authors:
Contributors:
Subject Terms: Computational complexity and cryptography, Theory and algorithms for application domains, Models of computation, Theory of computation, Randomness, geometry and discrete structures, Design and analysis of algorithms, geometry and discrete structures, ddc:004, Randomness
File Description: application/pdf
-
17
Contributors: et al.
Subject Terms: architecture verification and validation, artificial intelligence, design and analysis of algorithms, computational complexity and cryptography, embedded systems, model checking, formal methods, formal logic, machine learning, formal languages and automata theory, models of computation, semantics and reasoning, software engineering, theory and algorithms for application domains, thema EDItEUR::U Computing and Information Technology::UM Computer programming / software engineering::UMZ Software Engineering, thema EDItEUR::U Computing and Information Technology::UY Computer science::UYA Mathematical theory of computation, thema EDItEUR::U Computing and Information Technology::UY Computer science::UYQ Artificial intelligence::UYQE Expert systems / knowledge-based systems, thema EDItEUR::U Computing and Information Technology::UM Computer programming / software engineering::UMX Programming and scripting languages: general, thema EDItEUR::U Computing and Information Technology::UK Computer hardware, thema EDItEUR::U Computing and Information Technology::UY Computer science::UYQ Artificial intelligence::UYQL Natural language and machine translation
File Description: application/pdf
Relation: Lecture Notes in Computer Science; ONIX_20240913_9783031711770_29
-
18
Contributors: et al.
Subject Terms: architecture verification and validation, artificial intelligence, design and analysis of algorithms, computational complexity and cryptography, embedded systems, model checking, formal methods, formal logic, machine learning, formal languages and automata theory, models of computation, semantics and reasoning, software engineering, theory and algorithms for application domains, thema EDItEUR::U Computing and Information Technology::UM Computer programming / software engineering::UMZ Software Engineering, thema EDItEUR::U Computing and Information Technology::UY Computer science::UYA Mathematical theory of computation, thema EDItEUR::U Computing and Information Technology::UY Computer science::UYQ Artificial intelligence::UYQE Expert systems / knowledge-based systems, thema EDItEUR::U Computing and Information Technology::UM Computer programming / software engineering::UMX Programming and scripting languages: general, thema EDItEUR::U Computing and Information Technology::UK Computer hardware, thema EDItEUR::U Computing and Information Technology::UY Computer science::UYQ Artificial intelligence::UYQL Natural language and machine translation
File Description: application/pdf
Relation: Lecture Notes in Computer Science; ONIX_20240913_9783031711626_28
-
19
Authors: Amos Fiat
Source: Lecture Notes in Computer Science ISBN: 9780387973173
Subject Terms: Analysis of algorithms and problem complexity, Cryptography, RSA, Amortization, Computational complexity, Asymmetric cryptography, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology
File Description: application/xml
Full Text Finder 
Nájsť tento článok vo Web of Science