User argentpepper - Theoretical Computer Science Stack Exchange

Results from the 2022 Developer Survey are now available

argentpepper

Member for 11 years, 3 months
Last seen more than 2 years ago

6 Answers

Score Activity Newest

27 votes

What are the consequences of $\mathsf{L}^2 \subseteq \mathsf{P}$?

cc.complexity-theory complexity-classes conditional-results structural-complexity

answered Nov 2, 2015 at 16:39

4 votes

Finding the sparsest solution to a system of linear equations

np-hardness linear-algebra linear-programming matrices sparse-matrix

answered Dec 16, 2015 at 16:07

4 votes

Hardest problems to approximate

approximation-hardness clique

answered Jun 10, 2013 at 17:44

3 votes

Problems in $\text{PSPACE} \cap \text{Co-NP-Hard}$

cc.complexity-theory complexity-classes

answered Sep 4, 2014 at 18:04

2 votes

How big is NSC^k?

cc.complexity-theory space-bounded nondeterminism

answered Jan 30, 2013 at 0:14

1 vote

In what class are randomized algorithms that err with exactly 25% chance?

cc.complexity-theory complexity-classes randomized-algorithms

answered Dec 6, 2013 at 22:22