Complexity of the homomorphism extension problem in the random case

Details Complexity of the homomorphism extension problem in the random case Complexity of the homomorphism extension problem in the random case

2011-06-03

arxiv.org/abs/1106.0663v4

Mathematics

Combinatorics

9 pages, 2 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Complexity of the homomorphism extension problem in the random case does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of the homomorphism extension problem in the random case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of the homomorphism extension problem in the random case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-224015