Network profile

Lem n

Reputation

51

51

Apr
May
Jun
Jul

Top tag

p-vs-np

Next privilege

75 Rep.

Set bounties

Badges

1

4

Newest

Enthusiast

Next badge

6/10

Impact

0 posts edited

0 helpful flags

9 votes cast

Answers (2)

Votes Activity Newest

4	What is a natural problem in theory of computation?
1	Technical issue with PCP theorem proof

Reputation (51)

This user has no recent positive reputation changes

Questions (0)

Votes Activity Newest

This user has not asked any questions

Tags (6)

4 p-vs-np	4 complexity
4 time-complexity	1 cc.complexity-theory
4 fixed-parameter-tractable	1 pcp

Bookmarks (4)

Votes Activity Newest Views Added

47	What are the consequences of $\mathsf{L}^2 \subseteq \mathsf{P}$?
41	What hierarchies and/or hierarchy theorems do you know?
17	What if an $\mathsf L$-complete problem has $\mathsf{NC}^1$ circuits? More generally, what evidence is there against $\mathsf{NC}^1=\mathsf{L}$?
7	Is there a PSPACE-intermediate language?

Accounts (8)

	Theoretical Computer Science	51 rep	1 silver badge4 bronze badges
	Computer Science	41 rep	6 bronze badges
	Stack Overflow	1 rep
	Physics	1 rep
	Mathematics	1 rep

Badges (5)

Recent Class Name

Enthusiast	Editor
Supporter	Informed
Teacher

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (9)

all time			by type
9	up		3	question
0	down		6	answer

Theoretical Computer Science Stack Exchange works best with JavaScript enabled