By Topic

The complexity of finding medians

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Toda, S. ; Dept. of Comput. Sci. & Inf. Math, Univ. of Electro-Commun., Tokyo, Japan

PF(#P) is characterized in a manner similar to M.W. Krentel's (1988) characterization of Pf(NP). If MidP is the class of functions that give the medians in the outputs of metric Turing machines, then it is shown that every function in PF(#P) is polynomial time 1-Turing reducible to a function in MidP and MidP⊆PF(#P); that is, PF(#P)=PF(MidP[1]). Intuitively, finding medians is as hard computationally as PF(#P); this forms a contrast to an intuitive interpretation of Krentel's result that finding maxima (or minima) is as hard as PF(NP). Several applications of the result are shown

Published in:

Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on

Date of Conference:

22-24 Oct 1990