Standard

Two refinements of the polynomial hierarchy. / Selivanov, Victor L.

STACS 94 (STACS 1994). 1994. стр. 439-448 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 775 ).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Selivanov, VL 1994, Two refinements of the polynomial hierarchy. в STACS 94 (STACS 1994). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 775 , стр. 439-448. https://doi.org/10.1007/3-540-57785-8_161

APA

Selivanov, V. L. (1994). Two refinements of the polynomial hierarchy. в STACS 94 (STACS 1994) (стр. 439-448). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 775 ). https://doi.org/10.1007/3-540-57785-8_161

Vancouver

Selivanov VL. Two refinements of the polynomial hierarchy. в STACS 94 (STACS 1994). 1994. стр. 439-448. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-57785-8_161

Author

Selivanov, Victor L. / Two refinements of the polynomial hierarchy. STACS 94 (STACS 1994). 1994. стр. 439-448 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{c03e20dd61924bf39802f72db7887779,
title = "Two refinements of the polynomial hierarchy",
abstract = "We introduce and study two classifications refining the polynomial hierarchy. Both extend the difference hierarchy over NP and are analogs of some hierarchies from recursion theory. We answer some natural questions on the introduced classifications, e.g. we extend the result of J.Kadin that the difference hierarchy over NP does not collapse (if the polynomial hierarchy does not collapse).",
author = "Selivanov, {Victor L.}",
year = "1994",
month = jan,
day = "1",
doi = "10.1007/3-540-57785-8_161",
language = "English",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Nature",
pages = "439--448",
booktitle = "STACS 94 (STACS 1994)",

}

RIS

TY - GEN

T1 - Two refinements of the polynomial hierarchy

AU - Selivanov, Victor L.

PY - 1994/1/1

Y1 - 1994/1/1

N2 - We introduce and study two classifications refining the polynomial hierarchy. Both extend the difference hierarchy over NP and are analogs of some hierarchies from recursion theory. We answer some natural questions on the introduced classifications, e.g. we extend the result of J.Kadin that the difference hierarchy over NP does not collapse (if the polynomial hierarchy does not collapse).

AB - We introduce and study two classifications refining the polynomial hierarchy. Both extend the difference hierarchy over NP and are analogs of some hierarchies from recursion theory. We answer some natural questions on the introduced classifications, e.g. we extend the result of J.Kadin that the difference hierarchy over NP does not collapse (if the polynomial hierarchy does not collapse).

UR - http://www.scopus.com/inward/record.url?scp=84974720768&partnerID=8YFLogxK

U2 - 10.1007/3-540-57785-8_161

DO - 10.1007/3-540-57785-8_161

M3 - Conference contribution

AN - SCOPUS:84974720768

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 439

EP - 448

BT - STACS 94 (STACS 1994)

ER -

ID: 127142139