From randomizing polynomials to parallel algorithms

DOI10.1145/2090236.2090244zbMath1348.94059OpenAlexW2008593020MaRDI QIDQ2826046

Yuval Ishai, Eyal Kushilevitz, Anat Paskin-Cherniavsky

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2090236.2090244

zbMATH Keywords

cryptographyparallel algorithmssecure computationrandomizing polynomials

Mathematics Subject Classification ID

Cryptography (94A60) Parallel algorithms in computer science (68W10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Statistical Randomized Encodings: A Complexity Theoretic View

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES

This page was built for publication: From randomizing polynomials to parallel algorithms