Výsledky vyhľadávania - "CCS Concepts: Theory of computation → Computational complexity AND cryptography~"

Kolmogorov time hierarchy and novelty games ; Hiérarchie temporelle de Kolmogorov et jeux de trouvailles

Autori: Léchine, Ulysse Seiller, Thomas Laboratoire d'Informatique de Paris-Nord (LIPN) a ďalší

Prispievatelia: Léchine, Ulysse Seiller, Thomas Laboratoire d'Informatique de Paris-Nord (LIPN) a ďalší

Zdroj: https://hal.science/hal-04539439 ; 2025.

Predmety: CCS Concepts: Theory of computation → Computational complexity and cryptography, Theory of computation → Computational complexity and cryptography, CCS Concepts, Combinatorial game, Time hierarchy, Mathematics of computing → Discrete mathematics Kolmogorov Complexity, Combinatorics, Parallel computing, time bounded kolmogorov complexity, Complexity theory, Kolmogorov Complexity, [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]

Dostupnosť: https://hal.science/hal-04539439
https://hal.science/hal-04539439v3/document
https://hal.science/hal-04539439v3/file/main.pdf

Kolmogorov time hierarchy and novelty games ; Hiérarchie temporelle de Kolmogorov et jeux de trouvailles

Autori: Léchine, Ulysse Seiller, Thomas Laboratoire d'Informatique de Paris-Nord (LIPN) a ďalší

Prispievatelia: Léchine, Ulysse Seiller, Thomas Laboratoire d'Informatique de Paris-Nord (LIPN) a ďalší

Zdroj: https://hal.science/hal-04539439 ; 2024.

Predmety: 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]

Dostupnosť: https://hal.science/hal-04539439
https://hal.science/hal-04539439v2/document
https://hal.science/hal-04539439v2/file/Kolmogorov-v2.pdf

Memory Checking Requires Logarithmic Overhead.

Autori: Boyle, Elette Komargodski, Ilan Vafa, Neekon

Zdroj: Journal of the ACM; Apr2025, Vol. 72 Issue 2, p1-43, 43p

Predmety: CLIENT/SERVER computing, TRUST, CHECKERS, CHECKS, MEMORY

Almost Consistent Systems of Linear Equations.

Autori: Dabrowski, Konrad K. Jonsson, Peter Ordyniak, Sebastian a ďalší

Zdroj: ACM Transactions on Algorithms; Oct2025, Vol. 21 Issue 4, p1-55, 55p

Predmety: INTEGRAL domains, RINGS of integers, FINITE fields, CONSTRAINT satisfaction, LINEAR equations

OptORAMa: Optimal Oblivious RAM.

Autori: ASHAROV, GILAD KOMARGODSKI, ILAN WEI-KAI LIN a ďalší

Zdroj: Journal of the ACM; Feb2023, Vol. 70 Issue 1, p1-70, 70p

Predmety: DETERMINISTIC algorithms, CRYPTOCURRENCIES, LEAKS (Disclosure of information), COMPACTING, OPEN-ended questions

Two-round Multiparty Secure Computation from Minimal Assumptions.

Autori: GARG, SANJAM SRINIVASAN, AKSHAYARAM

Zdroj: Journal of the ACM; Sep2022, Vol. 69 Issue 5, p1-30, 30p

Predmety: PLAINS

SPARKs: Succinct Parallelizable Arguments of Knowledge.

Autori: EPHRAIM, NAOMI FREITAG, CODY KOMARGODSKI, ILAN a ďalší

Zdroj: Journal of the ACM; Sep2022, Vol. 69 Issue 5, p1-88, 88p

Predmety: POLYNOMIAL time algorithms, ARGUMENT, PARALLEL programming

Optimal Short-Circuit Resilient Formulas.

Autori: BRAVERMAN, MARK EFREMENKO, KLIM GELLES, RAN a ďalší

Zdroj: Journal of the ACM; Jul2022, Vol. 69 Issue 4, p1-37, 37p

Predmety: BLOCKCHAINS, CIRCUIT complexity, CODING theory

How to Delegate Computations: The Power of No-Signaling Proofs.

Autori: KALAI, YAEL TAUMAN RAZ, RAN ROTHBLUM, RON D.

Zdroj: Journal of the ACM; Jan2022, Vol. 69 Issue 1, p1-82, 82p

Predmety: QUANTUM entanglement, INFORMATION retrieval, FOREIGN language education, POLYNOMIAL time algorithms

White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing.

Autori: KOMARGODSKI, ILAN NAOR, MONI YOGEV, EYLON

Zdroj: Journal of the ACM; Sep2019, Vol. 66 Issue 5, p1-28, 28p

Predmety: RAMSEY theory, INDEPENDENT sets, HARDNESS

Near-optimal Linear Decision Trees for k-SUM and Related Problems.

Autori: KANE, DANIEL M. LOVETT, SHACHAR MORAN, SHAY

Zdroj: Journal of the ACM; Jun2019, Vol. 66 Issue 3, p1-18, 18p

Fast Learning Requires Good Memory.

Autori: Raz, Ran

Zdroj: Journal of the ACM; Jan2019, Vol. 66 Issue 1, p1-18, 18p

Predmety: ALGORITHMS, COMPUTER storage devices, LOGICAL prediction, LEARNING problems, CRYPTOGRAPHY

4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n^4/3.

Autori: BONNET, ÉDOUARD

Zdroj: ACM Transactions on Algorithms; Apr2022, Vol. 18 Issue 2, p1-14, 14p

Predmety: TIME, DIAMETER, HYPOTHESIS

Revocable Quantum Timed-Release Encryption.

Autori: UNRUH, DOMINIQUE

Zdroj: Journal of the ACM; Dec2015, Vol. 62 Issue 6, p49-49:76, 76p

Predmety: QUANTUM computers, DATA encryption, CRYPTOGRAPHY, DATA security, MATHEMATICAL proofs

Tight Bounds for Online TSP on the Line.

Autori: BJELDE, ANTJE HACKFELD, JAN DISSER, YANN a ďalší

Zdroj: ACM Transactions on Algorithms; Dec2020, Vol. 17 Issue 1, p1-58, 58p

Predmety: ONLINE algorithms, PARATRANSIT services, APPROXIMATION algorithms, COMPUTATIONAL complexity