Matt

Member for 8 years, 2 months

Reputation

113

113
108
103

2018
2019
2020
2021

Top tag

reference-request

Next privilege

125 Rep.

Vote down

Badges

6

Newest

Commentator

Next badge

0/1

Impact

0 posts edited

0 helpful flags

1 vote cast

Questions (2)

Votes Activity Newest

5	Given discrete rvs X,Y, find Z s.t. I(Z;X) is high and I(Z;Y) is low. -- known problem?
2	Why doesn't the standard analysis of set cover $H_n$ greedy extend to partial cover?

Reputation (113)

This user has no recent positive reputation changes

Answer (1)

Votes Activity Newest

4	Multidimensional knapsack STRONGLY NP-complete

Tags (7)

4 reference-request × 2	0 set-cover
4 np-hardness	0 approximation-algorithms
0 ds.algorithms	0 shannon-entropy
0 it.information-theory

Bookmarks (2)

Votes Activity Newest Views Added

5	Given discrete rvs X,Y, find Z s.t. I(Z;X) is high and I(Z;Y) is low. -- known problem?
2	Why doesn't the standard analysis of set cover $H_n$ greedy extend to partial cover?

Accounts (2)

	Theoretical Computer Science	113 rep	6 bronze badges
	MathOverflow	1 rep	1 bronze badge

Badges (6)

Recent Class Name

Commentator	Supporter
Teacher	Scholar
Editor	Student

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (1)

all time			by type
1	up		0	question
0	down		1	answer

Theoretical Computer Science Stack Exchange works best with JavaScript enabled