Network profile

Andras Farago

Reputation

10,310

10.3k
9.2k
8.1k

2017
2018
2019
2020

Top tag

cc.complexity-theory

Next privilege

15,000 Rep.

Protect questions

Badges

28

66

Newest

Popular Question

Next badge

0/1

Impact

0 posts edited

0 helpful flags

354 votes cast

Questions (61)

Votes Activity Newest

52	For which problems in P is it easier to verify the result than to find it?
44	Obituaries of dead conjectures
37	Examples where the uniqueness of the solution makes it easier to find
36	Hardness of approximation without the PCP theorem
36	Why does randomness have stronger effect on reductions than on algorithms?

View more →

Reputation (10,310)

+10	“Almost easy” NP-complete problems
+10	Consequences of $NP=coNP$ and $P\ne NP$?
+10	Is NP in $DTIME(n^{poly\log n})$?
+10	Minimum rank graph cut

View more →

Answers (25)

Votes Activity Newest

20	Is NP in $DTIME(n^{poly\log n})$?
18	Which randomized algorithms have exponentially small error probability?
15	Easy to optimize but hard to evaluate
12	Consequences of $NP=coNP$ and $P\ne NP$?
11	Evidence that Graph Isomorphism problem is not $NP$-complete

View more →

Tags (45)

117 cc.complexity-theory × 70	17 graph-theory × 23
45 complexity-classes × 21	15 optimization × 2
19 graph-algorithms × 26	15 polynomial-hierarchy × 2
19 np-hardness × 9	15 examples
18 randomized-algorithms × 3	14 conditional-results × 3

View more →

Accounts (3)

	Theoretical Computer Science	10,310 rep	28 silver badges66 bronze badges
	MathOverflow	123 rep	3 bronze badges
	Mathematics	111 rep	2 bronze badges

Badges (22)

Recent Class Name

Popular Question × 13	Civic Duty
Nice Question × 35	Good Question × 10
Yearling × 7	Necromancer × 2
Nice Answer × 6	Revival × 2
Enlightened	Notable Question × 5

View more →

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (354)

all time			by type
348	up		100	question
6	down		254	answer

Theoretical Computer Science Stack Exchange works best with JavaScript enabled