NCk(NP)=ACk−1(NP)

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

It is shown for any k≥1, that the closure of NP under NCk reducibility coincides with that of NP under ACk−1 reducibility, thereby giving an answer to a basic question that has been open for a long time. A similar result is shown for C=P.

Original languageEnglish (US)
Title of host publicationSTACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings
EditorsErnst W. Mayr, Klaus W. Wagner, Patrice Enjalbert
PublisherSpringer Verlag
Pages313-324
Number of pages12
ISBN (Print)9783540577850
StatePublished - Jan 1 1994
Externally publishedYes
EventProceedings of the 11th Symposium on Theoretical Aspects of Computer Science (STACS'94) - Caen, Fr
Duration: Feb 24 1994Feb 26 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume775 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceProceedings of the 11th Symposium on Theoretical Aspects of Computer Science (STACS'94)
CityCaen, Fr
Period2/24/942/26/94

Fingerprint

Reducibility
Closure

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Ogihara, M. (1994). NCk(NP)=ACk−1(NP). In E. W. Mayr, K. W. Wagner, & P. Enjalbert (Eds.), STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings (pp. 313-324). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 775 LNCS). Springer Verlag.

NCk(NP)=ACk−1(NP). / Ogihara, Mitsunori.

STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. ed. / Ernst W. Mayr; Klaus W. Wagner; Patrice Enjalbert. Springer Verlag, 1994. p. 313-324 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 775 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ogihara, M 1994, NCk(NP)=ACk−1(NP). in EW Mayr, KW Wagner & P Enjalbert (eds), STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 775 LNCS, Springer Verlag, pp. 313-324, Proceedings of the 11th Symposium on Theoretical Aspects of Computer Science (STACS'94), Caen, Fr, 2/24/94.
Ogihara M. NCk(NP)=ACk−1(NP). In Mayr EW, Wagner KW, Enjalbert P, editors, STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. Springer Verlag. 1994. p. 313-324. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Ogihara, Mitsunori. / NCk(NP)=ACk−1(NP). STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings. editor / Ernst W. Mayr ; Klaus W. Wagner ; Patrice Enjalbert. Springer Verlag, 1994. pp. 313-324 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{21af5439209f4a53ab900db6dda723dc,
title = "NCk(NP)=ACk−1(NP)",
abstract = "It is shown for any k≥1, that the closure of NP under NCk reducibility coincides with that of NP under ACk−1 reducibility, thereby giving an answer to a basic question that has been open for a long time. A similar result is shown for C=P.",
author = "Mitsunori Ogihara",
year = "1994",
month = "1",
day = "1",
language = "English (US)",
isbn = "9783540577850",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "313--324",
editor = "Mayr, {Ernst W.} and Wagner, {Klaus W.} and Patrice Enjalbert",
booktitle = "STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings",
address = "Germany",

}

TY - GEN

T1 - NCk(NP)=ACk−1(NP)

AU - Ogihara, Mitsunori

PY - 1994/1/1

Y1 - 1994/1/1

N2 - It is shown for any k≥1, that the closure of NP under NCk reducibility coincides with that of NP under ACk−1 reducibility, thereby giving an answer to a basic question that has been open for a long time. A similar result is shown for C=P.

AB - It is shown for any k≥1, that the closure of NP under NCk reducibility coincides with that of NP under ACk−1 reducibility, thereby giving an answer to a basic question that has been open for a long time. A similar result is shown for C=P.

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

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

M3 - Conference contribution

SN - 9783540577850

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

SP - 313

EP - 324

BT - STACS 1994 - 11th Annual Symposium on Theoretical Aspects of Computer Science, Proceedings

A2 - Mayr, Ernst W.

A2 - Wagner, Klaus W.

A2 - Enjalbert, Patrice

PB - Springer Verlag

ER -