Profile Activity

Lucas Cook

Network profile

Reputation

705

705
667
630

2016
2017
2018
2019

Top tag

complexity-theory

Next privilege

1,000 Rep.

See votes, expandable usercard

Badges

4

12

Newest

Yearling

Next badge

0/1

Impact

1 post edited

1 helpful flag

29 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

Answers (5)

Votes Activity Newest

15	how do you prove that SAT is NP-complete?
12	How to approach Dynamic graph related problems
7	Closure against right quotient with a fixed language
6	Irregularity of $\{a^ib^jc^k \mid \text{if } i=1 \text{ then } j=k \}$
5	Restricted version of the Clique problem?

Reputation (705)

+50	how do you prove that SAT is NP-complete?
+45	“Dense” regular expressions generate $\Sigma^*$?
+20	How to approach Dynamic graph related problems
+10	Restricted version of the Clique problem?

View more →

Question (1)

Votes Activity Newest

24	“Dense” regular expressions generate $\Sigma^*$?

Tags (11)

20 complexity-theory × 2	12 data-structures
15 satisfiability	12 graphs
13 formal-languages × 3	7 closure-properties
13 regular-languages × 3	6 pumping-lemma
12 algorithms	5 time-complexity

View more →

Accounts (4)

	Computer Science	705 rep	4 silver badges12 bronze badges
	Theoretical Computer Science	180 rep	1 silver badge7 bronze badges
	Stack Overflow	163 rep	9 bronze badges
	Mathematics	141 rep	3 bronze badges

Badges (13)

Recent Class Name

Yearling × 3	Citizen Patrol
Autobiographer	Critic
Enlightened	Commentator
Nice Answer × 2	Teacher
Editor	Supporter

View more →

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (29)

all time			by type
27	up		13	question
2	down		16	answer

Computer Science Stack Exchange works best with JavaScript enabled