DocumentCode
2785494
Title
The complexity of finding medians
Author
Toda, Seinosuke
Author_Institution
Dept. of Comput. Sci. & Inf. Math, Univ. of Electro-Commun., Tokyo, Japan
fYear
1990
fDate
22-24 Oct 1990
Firstpage
778
Abstract
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
Keywords
Turing machines; computational complexity; 1-Turing reducible; MidP; PF(#P); complexity; finding medians; metric Turing machines; Computational complexity; Computer science; History; Mathematics; Polynomials; Turing machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on
Conference_Location
St. Louis, MO
Print_ISBN
0-8186-2082-X
Type
conf
DOI
10.1109/FSCS.1990.89600
Filename
89600
Link To Document