Lwins

Member for 5 years, 2 months
Last seen more than a week ago

Summary

Reputation

360

360
302
245

2019
2020
2021
2022

Top tag

complexity-theory

Next privilege

500 Rep.

Access review queues

Badges

1

9

Newest

Critic

Next badge

4/5

Curious

Answers

Score Activity Newest

2

What is a good example of an NL-complete context free language?

Nov 17, 2017

1

Problems that provably require quadratic time

Jun 30, 2019

1

Problem class of assigning N persons to N tasks, zero costs with prefs

Jul 5, 2019

-1

Isn't NP problems always also co-NP problems?

Dec 12, 2017

Questions

Score Activity Newest Views

8

Can we convert an NFA to a regular expression of polynomial length?

Nov 16, 2017

7

Impossibility for Byzantine Generals Problem where $n \leq 3m$

Jun 1, 2017

3

Computational Irreducibility

Dec 12, 2017

2

Yao's minimax lemma for Monte Carlo algorithms

Apr 11, 2019

Tags

View all 17 tags

complexity-theory

3

Score

4

posts

space-complexity

2

Score

1

post

context-free

2

Score

1

post

turing-machines

1

Score

2

posts

time-complexity

1

Score

1

post

Reputation

This user has no recent positive reputation changes.

Badges

View all badges

This user doesn’t have any gold badges yet.

1

silver badge

Yearling

Dec 18, 2018

9

bronze badges

Tumbleweed

Jul 3, 2017
Revival

Dec 18, 2018
Critic

Jul 4, 2019

Bookmarks

Score Activity Newest Views Added

12

What is complexity class $\oplus P^{\oplus P}$

May 14, 2012

9

How can the shortest traveling salesman tour be found in $O(2^n poly(n))$ time and less than exponential space?

Jul 14, 2017

Accounts

View all 10 accounts

1,297
9
21

614
3
14

Theoretical Computer Science

395
1
13

Computer Science

360
1
9

113
4

Active bounties (0)

Active Offered Earned

This user has no active bounties

Votes cast

21

upvotes

7

question votes

14

answer votes