Fourier analysis of Boolean functions yields two phenomena—preservation of coordinate influence under random 2-to-1 minors and sharp thresholds—that classify hardness and tractability for Boolean PCSP minions of unate or polynomial threshold functions, extending prior ordered-PCSP results.
Roth, editor.The Shapley V alue: Essays in Honor of Lloyd S
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Projects GNN embeddings of IoT traffic onto interpretable manifolds to achieve 0.83 F1-score intrusion detection and reveal concept drift.
citing papers explorer
-
Boolean PCSPs through the lens of Fourier Analysis
Fourier analysis of Boolean functions yields two phenomena—preservation of coordinate influence under random 2-to-1 minors and sharp thresholds—that classify hardness and tractability for Boolean PCSP minions of unate or polynomial threshold functions, extending prior ordered-PCSP results.
-
Interpreting Manifolds and Graph Neural Embeddings from Internet of Things Traffic Flows
Projects GNN embeddings of IoT traffic onto interpretable manifolds to achieve 0.83 F1-score intrusion detection and reveal concept drift.