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

4 Scopus citations


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
EditorsPatrice Enjalbert, Ernst W. Mayr, Klaus W. Wagner
PublisherSpringer Verlag
Number of pages12
ISBN (Print)9783540577850
StatePublished - 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


ConferenceProceedings of the 11th Symposium on Theoretical Aspects of Computer Science (STACS'94)
CityCaen, Fr

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'NC<sup>k</sup>(NP)=AC<sup>k−1</sup>(NP)'. Together they form a unique fingerprint.

Cite this