Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

3

IPL
2016

favoriteEmaildiscussreport

53views more IPL 2016»

The complexity of the Kth largest subset problem and related problems

8 years 25 days ago

The complexity of the Kth largest subset problem and related problems

Download www.lsv.ens-cachan.fr

We show that the Kth largest subset problem and the Kth largest m-tuple problem are in PP and hard for PP under polynomial-time Turing reductions. Several problems from the literature were previously shown NPhard via reductions from those two problems, and by our main result they become PP-hard as well. We also provide complementary PP-upper bounds for some of them.

Christoph Haase, Stefan Kiefer

Real-time Traffic

IPL 2016 |

claim paper

Related Content

» The Largest Compatible Subset Problem for Phylogenetic Data

» NearOptimal Lower Bounds on the MultiParty Communication Complexity of Set Disjointness

» Online Estimation For SubsetBased SQL Queries

» Combined Dynamic Tracking and Recognition of Curves with Application to Road Detection

» SNPs Problems Complexity and Algorithms

» Computational Complexity of Some Problems Involving Congruences on Algebras

» Approximation and Hardness Results for Label Cut and Related Problems

» The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers

» A Topological Analysis of Monitor Placement

» Bounded TreeWidth and CSPRelated Problems

Post Info
More Details (n/a)

Added	05 Apr 2016
Updated	05 Apr 2016
Type	Journal
Year	2016
Where	IPL
Authors	Christoph Haase, Stefan Kiefer

Comments (0)