An Upper Bound on Checking Test Complexity for Almost All Cographs

The concept of a checking test is of prime interest to the study of a variant of exact identification problem, in which the learner is given a hint about the unknown object. A graph F is said to be a checking test for a co graph G iff for any other co graph H there exists an edge in F distinguishing...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Zubkov, O. V., Chistikov, D. V., Voronenko, A. A.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Binary trees Boolean functions checking test cograph complexity Complexity theory Education equivalence query Polynomials read-once Boolean function teaching Upper bound Vectors
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!