ALGORITHMIC ENUMERATION OF PROBLEMS IN THE CLASS NPcoNP

ALGORITHMIC ENUMERATION OF PROBLEMS IN THE CLASS NPcoNP

The problem of recursive (algorithmic) representation is considered for the complexity class NPcoNP. A new method is proposed for algorithmically enumerating all problems in NPcoNP, using polynomial-time nondeterministic Turing machines.

Saved in:
Bibliographic Details
Main Author: V. G. Naidenko
Format: Article
Language:Russian
Published: National Academy of Sciences of Belarus, the United Institute of Informatics Problems 2016-09-01
Series:Informatika
Online Access:https://inf.grid.by/jour/article/view/75
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items

Similar Items