Pages that link to "Item:Q5091783"

The following pages link to A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783):

Displaying 5 items.

• The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
• Algorithms and conditional lower bounds for planning problems (Q2238604) (← links)
• Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
• (Q5226195) (← links)
• (Q5874535) (← links)