Profile Activity

skankhunt42

Network profile

Reputation

487

497
492
487

Mar
Jun
Sep
Dec

Top tag

formal-languages

Next privilege

500 Rep.

Access review queues

Badges

2

12

Newest

Yearling

Next badge

0/1

Impact

3 posts edited

3 helpful flags

30 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

Questions (7)

Votes Activity Newest

13	Finding optimal sequence of questions to minimize total student time
6	Logspace algorithm for s-t connectivity in undirected forests
3	Solving recurrence $T_k(n) = T_k\left(\left \lfloor \frac{n}{2} \right \rfloor\right) + T_k\left(\left \lceil \frac{n}{2} \right \rceil\right)$
2	Selecting optimal order of questions to minimize total time
1	How can languages that are E-complete have sub-exponential size circuits?

View more →

Reputation (487)

This user has no recent positive reputation changes

View more →

Answers (2)

Votes Activity Newest

6	Is the set of strings $0^{2k}10^{2k}10^{k}$ for $k \geq 0$ context-free?
4	Deciding whether the language of a CFG equals some specific regular language

Tags (18)

6 formal-languages	0 complexity-theory × 3
6 formal-grammars	0 greedy-algorithms × 2
6 context-sensitive	0 optimization
4 undecidability	0 discrete-mathematics
0 algorithms × 4	0 dynamic-programming

View more →

Accounts (5)

	Computer Science	487 rep	2 silver badges12 bronze badges
	Mathematics	345 rep	1 silver badge7 bronze badges
	Physics	131 rep	2 bronze badges
	Stack Overflow	113 rep	3 bronze badges
	Server Fault	111 rep	2 bronze badges

Badges (13)

Recent Class Name

Yearling × 2	Teacher
Nice Question	Organizer
Curious	Citizen Patrol
Commentator	Critic
Explainer	Scholar

View more →

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast (30)

all time			by type
16	up		18	question
14	down		12	answer

Computer Science Stack Exchange works best with JavaScript enabled