Complexity of the homomorphism extension problem in the random case
Combinatorics
2012-09-03 v5
Abstract
We prove that if A is a large random relational structure with at least one relation of arity at least 2 then the problem EXT(A) is almost surely NP-complete.
Cite
@article{arxiv.1106.0663,
title = {Complexity of the homomorphism extension problem in the random case},
author = {Alexandr Kazda},
journal= {arXiv preprint arXiv:1106.0663},
year = {2012}
}
Comments
8 pages