arXiv (All)open access
Analysis of Polynomial Threshold Functions on Random Regular Graphs: Computational Complexity of Detecting Noisy Random Lifts
combinatorics, computational complexity, data structures and algorithms, 05c80, f.2.2; g.2.2
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Related documents
Record · ID 972474
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.