Network profile

sangxia

Reputation

171

171
166
161

2018
2019
2020
2021

Top tag

approximation-hardness

Next privilege

250 Rep.

View close votes

Badges

5

Newest

Nice Answer

Next badge

0/1

Impact

0 posts edited

0 helpful flags

0 votes cast

Answers (3)

Votes Activity Newest

10	hardness of approximating the chromatic number in graphs with bounded degree
4	Approximation Algorithms for MAXSAT
3	PCP characterization of NP

Reputation (171)

This user has no recent positive reputation changes

Questions (0)

Votes Activity Newest

This user has not asked any questions

Tags (10)

14 approximation-hardness × 2	4 sat
13 cc.complexity-theory × 2	4 approximation-algorithms
10 bounded-degree	4 ds.algorithms
10 graph-colouring	3 pcp
10 hypergraphs	3 complexity-classes

Bookmarks (6)

Votes Activity Newest Views Added

38	Prerequisite for learning GCT
36	Collaborative tools for dummies/professors
32	Is Gap-3SAT NP-complete even for 3CNF formulas where no pair of variables appears in significantly more clauses than the average?
26	When is relaxed counting hard?
26	What is the complexity of distinguishing a true Fourier spectra from a fake one?

View more →

Accounts (4)

	Theoretical Computer Science	171 rep	5 bronze badges
	MathOverflow	73 rep	4 bronze badges
	Area 51	51 rep	1 bronze badge
	Stack Overflow	1 rep

Badges (5)

Recent Class Name

Nice Answer	Autobiographer
Informed	Teacher
Analytical

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (0)

This user has not cast any votes

Theoretical Computer Science Stack Exchange works best with JavaScript enabled