On the hardness of finding subsets with equal average

On the hardness of finding subsets with equal average

Bibliographic Details
Main Authors:	Elkind, E, Orlin, J
Format:	Journal article
Published:	2013

Similar Items

Reconfiguration of Satisfying Assignments and Subset Sums: Easy to Find, Hard to Connect
by: Cardinal, Jean, et al.
Published: (2021)

Reconfiguration of satisfying assignments and subset sums: Easy to find, hard to connect
by: Demaine, Erik D
Published: (2020)

On the variance of average distance of subsets in the Hamming space
by: Fu, Fang-Wei, et al.
Published: (2013)

Pigeonhole Equal Subset Sum in O ⃰ (2ⁿ/³)
by: Zhang, Stan
Published: (2024)

PTA: finding hard-to-find data plane bugs
by: Bressana, P, et al.
Published: (2022)

Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average
by: Gamarnik, David, et al.
Published: (2022)

Computing the partition function of the Sherrington–Kirkpatrick model is hard on average
by: Gamarnik, David, et al.
Published: (2022)

NP-Hardness of checking the unichain condition in average cost MDPs
by: Tsitsiklis, John N.
Published: (2012)

Finding hard-to-find data plane bugs with a PTA
by: Bressana, P, et al.
Published: (2020)

Finding fixed points by averaging with well-behaved maps
Published: (2004)

Subsets close to invariant subsets for group actions
by: Brailovsky, Leonid., et al.
Published: (2011)

Cracking the hard class : strategies for managing the harder than average class /
by: Rogers, Bill, 1947-
Published: (2006)

Subsets close to invariant subsets for group actions
by: Brailovsky, L, et al.
Published: (1995)

Optimized performance evaluation of LTE hard handover algorithm with average RSRP constraint
by: Lin, Cheng-Chung, et al.
Published: (2011)

Simultaneous contests with equal sharing allocation of prizes: computational complexity and price of anarchy
by: Elkind, E, et al.
Published: (2022)

Cloning in Elections: Finding the Possible Winners
by: Elkind, E, et al.
Published: (2011)

Cloning in Elections: Finding the Possible Winners
by: Elkind, E, et al.
Published: (2014)

MATRIX p-NORMS ARE NP-HARD TO APPROXIMATE IF p not equal to 1, 2, infinity
by: Hendrickx, Julien, et al.
Published: (2011)

Subset selection in regression /
by: 343814 Miller, Alan J.
Published: (1990)

Human T cell subsets.
by: Beverley, P
Published: (1987)

Distinct Volume Subsets
by: Conlon, David, et al.
Published: (2015)

Functional subsets of lymphocytes.
by: Beverley, P
Published: (1979)

Dense clusters of primes in subsets
by: Maynard, J
Published: (2016)

Finding a Hamiltonian Path in a Cube with Specified Turns is Hard
by: Abel, Zachary Ryan, et al.
Published: (2014)

Who witnesses the witness? Finding witnesses in the witness is hard and sometimes impossible
by: Abel, Zachary R, et al.
Published: (2020)

Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
by: Abel, Zachary R, et al.
Published: (2020)

Randomized algorithms for finding the shortest negative cost cycle in networks
by: Orlin, James B, et al.
Published: (2020)

Complexity of finding equilibria of plurality voting under structured preferences
by: Elkind, E, et al.
Published: (2016)

Generalizations of Product-Free Subsets
by: Kedlaya, Kiran S., et al.
Published: (2011)

Subset comparatives as comparative quantifiers
by: Nussbaum, Miriam Claire
Published: (2018)

Counting polynomial subset sums
by: Li, Jiyou, et al.
Published: (2021)

Elephant Expedition - Subset of data
by: Cardoso, A
Published: (2018)

Antigenic phenotypes of T-cell subsets.
by: Beverley, P, et al.
Published: (1977)

Illusion of Equality /
by: 292963 Cooper, David E.
Published: (1980)

An O(Nm) Time Algorithm for Finding the Min Length Directed Cycle in a Graph
by: Sedeno-Noda, Antonio, et al.
Published: (2018)

Conjugacy of Finite Subsets in Hyperbolic Groups.
by: Bridson, M, et al.
Published: (2005)

On the Number of Latent Subsets of Intersecting Collections
by: Kleitman, Daniel J., et al.
Published: (2004)

ON GROUPS WITH NO REGULAR ORBITS ON THE SET OF SUBSETS
by: Cameron, P, et al.
Published: (1984)

Proof of Komlós's conjecture on Hamiltonian subsets
by: Kim, J, et al.
Published: (2017)

An equal chance: equalities and inequalities of educational opportunity/
by: 171774 Birley, Derek, et al.
Published: (1971)