Výsledky vyhledávání - "Theory of computation → Generating random combinatorial structures"

Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing

Autoři: Goldreich, Oded Wigderson, Avi Oded Goldreich and Avi Wigderson a další

Přispěvatelé: Goldreich, Oded Wigderson, Avi Oded Goldreich and Avi Wigderson a další

Zdroj: TheoretiCS, Vol Volume 1 (2022)
36th Computational Complexity Conference, {CCC} 2021

Témata: non-malleable extractors, FOS: Computer and information sciences, tolerant testing, QA75.5-76.95, 0102 computer and information sciences, Computational Complexity (cs.CC), 01 natural sciences, Computer Science - Computational Complexity, Asymmetric graphs, Electronic computers. Computer science, two-source extractors, computer science - computational complexity, ddc:004, coding theory, 0101 mathematics, testing graph properties, Theory of computation → Generating random combinatorial structures, expanders, random graphs

Popis souboru: application/pdf

Přístupová URL adresa: http://arxiv.org/abs/2112.00673
https://doaj.org/article/119e7f9d4fc94376aba2f3c307221ecd
https://drops.dagstuhl.de/opus/volltexte/2021/14286/pdf/LIPIcs-CCC-2021-12.pdf/
https://dblp.uni-trier.de/db/conf/coco/coco2021.html#0001W21
https://drops.dagstuhl.de/opus/volltexte/2021/14286/
https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2021.12