← 研踪 PaperTrailarXiv:2604.22742 · v2
Boolean PCSPs through the lens of Fourier Analysis
首次提交 2026-04-25 01:40
版本更新 2026-10-29 19:28
雷达观测 2026-10-30 13:28
摘要
We develop an analytical framework for Boolean promise constraint satisfaction problems (PCSPs) that studies polymorphisms through the notion of influence from Fourier analysis of Boolean functions. Extending the work of Brakensiek, Guruswami, and Sandeep [ICALP'21] on Ordered PCSPs, we identify two general phenomena in Boolean minions indicative of hardness or tractability: (1) preservation of coordinate influence under random 2-to-1 minors and (2) the presence of sharp thresholds. We demonstrate that these phenomena occur in broader settings than previously established, yielding new hardness/tractability results for minions consisting of unate or polynomial threshold functions.
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v2 · 2026-10-29 19:28 · 最新观测版本
Boolean PCSPs through the lens of Fourier Analysis
We develop an analytical framework for Boolean promise constraint satisfaction problems (PCSPs) that studies polymorphisms through the notion of influence from Fourier analysis of Boolean functions. Extending the work of Brakensiek, Guruswami, and Sandeep [ICALP'21] on Ordered PCSPs, we identify two general phenomena in Boolean minions indicative of hardness or tractability: (1) preservation of coordinate influence under random 2-to-1 minors and (2) the presence of sharp thresholds. We demonstrate that these phenomena occur in broader settings than previously established, yielding new hardness/tractability results for minions consisting of unate or polynomial threshold functions.
查看此版本解读 →查看此版本原文 ↗