Reducing the number of solutions of NP functions?

Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung

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

1 Scopus citations

Abstract

We study whether one can prune solutions from NP functions. Though it is known that, unless surprising complexity class collapses occur, one cannot reduce the number of accepting paths of NP machines [17], we nonetheless show that it often is possible to reduce the number of solutions of NP functions. For finite cardinality types, we give a sufficient condition for such solution reduction. We also give absolute and conditional necessary conditions for solution reduction, and in particular we show that in many cases solution reduction is impossible unless the polynomial hierarchy collapses.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages394-404
Number of pages11
Volume1893
ISBN (Print)3540679014
DOIs
StatePublished - 2000
Externally publishedYes
Event25th International Symposium on Mathematical Foundations of Computer Science, MFCS 2000 - Bratislava, Slovakia
Duration: Aug 28 2000Sep 1 2000

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1893
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other25th International Symposium on Mathematical Foundations of Computer Science, MFCS 2000
CountrySlovakia
City Bratislava
Period8/28/009/1/00

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Hemaspaandra, L. A., Ogihara, M., & Wechsung, G. (2000). Reducing the number of solutions of NP functions? In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1893, pp. 394-404). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1893). Springer Verlag. https://doi.org/10.1007/3-540-44612-5_35