Network profile

sd234

Reputation

551

551
531
511

2018
2019
2020
2021

Next privilege

1,000 Rep.

See votes

Badges

2

8

Newest

Yearling

Next badge

0/1

Impact

0 posts edited

0 helpful flags

4 votes cast

Questions (7)

Votes Activity Newest

9	Planted Clique in G(n,p), varying p
6	Deciding whether the sum of independent random variables exceeds a threshold a majority of the time, PP-hard?
6	Variants of Densest Subgraph Problems
6	In a random perfect matching of a regular bipartite graph, are all edges equally probable?
4	Polynomial-time distinguishability threshold of planted clique

View more →

Reputation (551)

+20	Variants of Densest Subgraph Problems
+20	Deciding whether the sum of independent random variables exceeds a threshold a majority of the time, PP-hard?
+10	Planted Clique in G(n,p), varying p
+10	Deciding whether the sum of independent random variables exceeds a threshold a majority of the time, PP-hard?

View more →

Answers (2)

Votes Activity Newest

4	What is this matrix column-selection problem, and how hard is it to approximate?
3	Deciding whether the sum of independent random variables exceeds a threshold a majority of the time, PP-hard?

Tags (0)

This user has not participated in any tags

Bookmarks (3)

Votes Activity Newest Views Added

6	Variants of Densest Subgraph Problems
3	Agnostic Learning of K-Juntas over “small” distribution
3	What is this matrix column-selection problem, and how hard is it to approximate?

Accounts (3)

	Theoretical Computer Science	551 rep	2 silver badges8 bronze badges
	Mathematics	457 rep	2 silver badges9 bronze badges
	MathOverflow	163 rep	4 bronze badges

Badges (9)

Recent Class Name

Yearling × 2	Supporter
Curious	Scholar
Commentator	Student
Self-Learner	Editor
Teacher

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (4)

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

Theoretical Computer Science Stack Exchange works best with JavaScript enabled