Pages that link to "Item:Q673010"

The following pages link to Exponential lower bounds for the tree-like Hajós calculus (Q673010):

Displaying 2 items.

• Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz (Q650840) (← links)
• The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)