Reducing the number of solutions of NP functions

Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung

Research output: Contribution to journalArticle

6 Citations (Scopus)

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, 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)
Pages (from-to)311-328
Number of pages18
JournalJournal of Computer and System Sciences
Volume64
Issue number2
DOIs
StatePublished - Mar 2002
Externally publishedYes

Fingerprint

Number of Solutions
Polynomial Hierarchy
Complexity Classes
Cardinality
Necessary Conditions
Path
Sufficient Conditions
Polynomials

Keywords

  • Cardinality types
  • Computational complexity
  • Function refinement
  • Multivalued functions
  • NP functions
  • NPMV
  • Reducing solutions
  • Selectivity theory
  • Semi-feasible computation
  • Solution-pruning algorithms
  • The Narrowing-Gap Condition

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

Reducing the number of solutions of NP functions. / Hemaspaandra, Lane A.; Ogihara, Mitsunori; Wechsung, Gerd.

In: Journal of Computer and System Sciences, Vol. 64, No. 2, 03.2002, p. 311-328.

Research output: Contribution to journalArticle

Hemaspaandra, Lane A. ; Ogihara, Mitsunori ; Wechsung, Gerd. / Reducing the number of solutions of NP functions. In: Journal of Computer and System Sciences. 2002 ; Vol. 64, No. 2. pp. 311-328.
@article{17b4b4a3fbee49c38b766bf4206564c7,
title = "Reducing the number of solutions of NP functions",
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, 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.",
keywords = "Cardinality types, Computational complexity, Function refinement, Multivalued functions, NP functions, NPMV, Reducing solutions, Selectivity theory, Semi-feasible computation, Solution-pruning algorithms, The Narrowing-Gap Condition",
author = "Hemaspaandra, {Lane A.} and Mitsunori Ogihara and Gerd Wechsung",
year = "2002",
month = "3",
doi = "10.1006/jcss.2001.1815",
language = "English (US)",
volume = "64",
pages = "311--328",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "2",

}

TY - JOUR

T1 - Reducing the number of solutions of NP functions

AU - Hemaspaandra, Lane A.

AU - Ogihara, Mitsunori

AU - Wechsung, Gerd

PY - 2002/3

Y1 - 2002/3

N2 - 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, 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.

AB - 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, 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.

KW - Cardinality types

KW - Computational complexity

KW - Function refinement

KW - Multivalued functions

KW - NP functions

KW - NPMV

KW - Reducing solutions

KW - Selectivity theory

KW - Semi-feasible computation

KW - Solution-pruning algorithms

KW - The Narrowing-Gap Condition

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

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

U2 - 10.1006/jcss.2001.1815

DO - 10.1006/jcss.2001.1815

M3 - Article

AN - SCOPUS:0036507134

VL - 64

SP - 311

EP - 328

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 2

ER -