Showing 1 - 2 results of 2 for search 'V. G. Naidenko', query time: 0.01s Refine Results
  1. 1
    Logical characterization of complexity class of problems solvable by probablistic algorithms in polynomial time

    Logical characterization of complexity class of problems solvable by probablistic algorithms in polynomial time by V. G. Naidenko

    Published 2018-12-01
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    ALGORITHMIC ENUMERATION OF PROBLEMS IN THE CLASS NPcoNP

    ALGORITHMIC ENUMERATION OF PROBLEMS IN THE CLASS NPcoNP by V. G. Naidenko

    Published 2016-09-01
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: