NP by Means of Lifts and Shadows

DOI10.1007/978-3-540-74456-6_17zbMath1147.68534OpenAlexW2109712823MaRDI QIDQ3525566

Gábor Kun, Jaroslav Nešetřil

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_17

zbMATH Keywords

digraphdualityhomomorphismconstraint satisfaction problemNP

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)

Related Items (3)

Oriented expressions of graph properties ⋮ Many Facets of Dualities ⋮ On the CSP Dichotomy Conjecture

This page was built for publication: NP by Means of Lifts and Shadows