Princeton University Press / John Wiley and Sons / Goldman / /
Currency
pence / / /
Facility
Cybernetics Lomonosov Moscow State University / University Computational Mathematics / /
IndustryTerm
polynomial algorithm / combinatorial search problem / control systems / bioinformatics applications / linear recognition algorithm / /
Movie
D. V / /
Organization
Princeton University / Andrey A. Voronenko Faculty of Computational Mathematics and Cybernetics Lomonosov Moscow State University Moscow / Computer Science East-Siberian State Academy of Education Irkutsk / Russian Foundation for Basic Research / /
Person
M. Bouvel / V / Andrey A. Voronenko / L. Stewart Burlingham / Dmitry V. Chistikov / Oleg V. Zubkov / / /
ProgrammingLanguage
Perl / /
PublishedMedium
Journal of the ACM / Machine Learning / Communications of the ACM / Lecture Notes in Computer Science / /
An Upper Bound on Checking Test Complexity for Almost All Cographs Oleg V. Zubkov Department of Computer Science East-Siberian State Academy of Education Irkutsk, Russia Email: