Pages that link to "Item:Q5092489"

The following pages link to Sum of squares bounds for the ordering principle (Q5092489):

Displaying 3 items.

• On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)
• Perfect matching in random graphs is as hard as Tseitin (Q6562700) (← links)
• Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)