2018/10/21 by Yaqiao Li, Li, Yaqiao
Computer Science · #Advanced Algebra and Logic #Combinatorics (math.CO) #Complexity and Algorithms in Graphs #Computability, Logic, AI Algorithms #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1810.08873
openalex publication_date 2018/10/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show conflict complexity of every total Boolean function, recently introduced in [Swagato Sanyal. A composition theorem via conict complexity. arXiv preprint arXiv:1801.03285, 2018.] to prove a composition theorem of randomized decision tree complexity, is at least a half of its block sensitivity. We propose to compare conflict complexity with certificate complexity, and explain why it could be interesting.