Výsledky vyhľadávania - "Theory of computation → Circuit complexity"

Limits of Preprocessing

Autori: Filmus, Yuval Ishai, Yuval Kaplan, Avi a ďalší

Prispievatelia: Filmus, Yuval Ishai, Yuval Kaplan, Avi a ďalší

Zdroj: 35th Computational Complexity Conference

Predmety: 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 súboru: application/pdf

Prí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

Certificate Games

Autori: Chakraborty, Sourav Gál, Anna Laplante, Sophie a ďalší

Prispievatelia: Chakraborty, Sourav Gál, Anna Laplante, Sophie a ďalší

Predmety: 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 súboru: application/pdf

Prístupová URL adresa: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.32

Fourier conjectures, correlation bounds, and Majority *

Autori: Viola, Emanuele Northeastern University Boston

Prispievatelia: Viola, Emanuele Northeastern University Boston

Zdroj: ICALP ; https://hal.science/hal-04277563 ; ICALP, Jan 2021, Virtual conference, United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.111⟩

Predmety: Fourier analysis, polynomials, Majority, correlation, lower bound, conjectures, Theory of computation → Circuit complexity, [INFO]Computer Science [cs]

Geografické téma: Virtual conference, United Kingdom

Time: Virtual conference, United Kingdom

Relation: hal-04277563; https://hal.science/hal-04277563; https://hal.science/hal-04277563/document; https://hal.science/hal-04277563/file/L12requiresCor.pdf

Dostupnosť: https://hal.science/hal-04277563
https://hal.science/hal-04277563/document
https://hal.science/hal-04277563/file/L12requiresCor.pdf
https://doi.org/10.4230/LIPIcs.ICALP.2021.111

enSmall Hazard-Free Transducers

Autori: Bund, Johannes Lenzen, Christoph Medina, Moti a ďalší

Prispievatelia: Bund, Johannes Lenzen, Christoph Medina, Moti a ďalší

Predmety: Hazard-Freeness, Parallel Prefix Computation, Finite State Transducers, Hardware → Fault tolerance, Theory of computation → Circuit complexity