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.
Injective hardness condition for PCSPs
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 2roles
background 1polarities
background 1representative citing papers
An asynchronous multiparty session calculus with mixed choice is equipped with a coherence-based type system using coinductive global types, proving subject reduction, session fidelity, lock-freedom, and orphan-message-freedom.
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.
-
Asynchronous Multiparty Sessions with Mixed Choice
An asynchronous multiparty session calculus with mixed choice is equipped with a coherence-based type system using coinductive global types, proving subject reduction, session fidelity, lock-freedom, and orphan-message-freedom.