NP for Combinatorialists (Q3503495)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	NP for Combinatorialists	scientific article

Statements

scholarly article

0 references

NP for Combinatorialists (English)

0 references

0 references

Jaroslav Nešetřil

0 references

Electronic Notes in Discrete Mathematics

0 references

publication date

5 June 2008

0 references

zbMATH Keywords

NP problem

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.endm.2007.07.062

0 references

On preservation under homomorphisms and unions of conjunctive queries

0 references

Coloring graphs with locally few colors

0 references

0 references

The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory

0 references

Complexity of graph partition problems

0 references

0 references

Constraints, MMSNP and expander relational structures

0 references

On the Structure of Polynomial Time Reducibility

0 references

Linear time low tree-width partitions and algorithmic consequences

0 references

Chromatically optimal rigid graphs

0 references

Duality theorems for finite structures (characterising gaps and good characterisations)

0 references

Local chromatic number, Ky Fan's theorem, and circular colorings

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.ENDM.2007.07.062

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3503495

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3503495&oldid=39319224"