Network profile

TCS Guy

Reputation

109

109
64
19

Apr
Jul
Oct
Jan

Top tag

complexity-theory

Next privilege

125 Rep.

Vote down

Badges

4

Newest

Curious

Next badge

0/1

Impact

0 posts edited

0 helpful flags

2 votes cast

Questions (8)

Votes Activity Newest

5	Why the Cook-Levin reduction is not a parsimonious reduction?
2	Configurations and CNF formula for neighboring configuration
2	What is Ironic complexity? What are some good resources to learn about it?
1	Are all NP-complete languages downward self-reducible?
1	Importance of space constructability in time space relation in complexity

View more →

Reputation (109)

+20	Configurations and CNF formula for neighboring configuration
+10	Are all NP-complete languages downward self-reducible?
+10	Importance of space constructability in time space relation in complexity
+10	Why the Cook-Levin reduction is not a parsimonious reduction?

View more →

Answer (1)

Votes Activity Newest

0	How to prove the language of suffixes of a regular language is still regular?

Tags (12)

0 complexity-theory × 7	0 church-turing-thesis
0 np-complete × 3	0 nondeterminism
0 space-complexity × 2	0 time-complexity
0 turing-machines × 2	0 formal-languages
0 np	0 regular-languages

View more →

Bookmarks (0)

Votes Activity Newest Views Added

This user has no bookmarked questions.

Accounts (8)

	Theoretical Computer Science	145 rep	4 bronze badges
	Computer Science	109 rep	4 bronze badges
	MathOverflow	39 rep	4 bronze badges
	Philosophy	21 rep	3 bronze badges
	Mathematics	21 rep	2 bronze badges

Badges (4)

Recent Class Name

Curious	Supporter
Editor	Student

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (2)

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

Computer Science Stack Exchange works best with JavaScript enabled