Zobrazeno 1 - 10
of 432
pro vyhledávání: '"Dvořák, Pavel"'
We study semidefinite relaxations of $\Pi_1$ combinatorial statements. By relaxing the pigeonhole principle, we obtain a new "quantum" pigeonhole principle which is a stronger statement. By relaxing statements of the form "the communication complexit
Externí odkaz:
http://arxiv.org/abs/2409.04592
Proving super-polynomial lower bounds on the size of proofs of unsatisfiability of Boolean formulas using resolution over parities is an outstanding problem that has received a lot of attention after its introduction by Raz and Tzamaret [Ann. Pure Ap
Externí odkaz:
http://arxiv.org/abs/2402.04364
[Alecu et al.: Graph functionality, JCTB2021] define functionality, a graph parameter that generalizes graph degeneracy. They research the relation of functionality to many other graph parameters (tree-width, clique-width, VC-dimension, etc.). Extend
Externí odkaz:
http://arxiv.org/abs/2302.11862