Nondeterministic graph property testing

Details Nondeterministic graph property testing Nondeterministic graph property testing

2012-02-23

arxiv.org/abs/1202.5337v1

Mathematics

Combinatorics

9 pages

Scientific paper

A property of finite graphs is called nondeterministically testable if it has a "certificate" such that once the certificate is specified, its correctness can be verified by random local testing. In this paper we study certificates that consist of one or more unary and/or binary relations on the nodes, in the case of dense graphs. Using the theory of graph limits, we prove that nondeterministically testable properties are also deterministically testable.

Affiliated with

Also associated with

No associations

Rating

Nondeterministic graph property testing 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 Nondeterministic graph property testing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nondeterministic graph property testing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-78009