Network profile

argentpepper

Reputation

2,211

2.2k
2.1k
1.9k

2017
2018
2019
2020

Top tag

cc.complexity-theory

Next privilege

2,500 Rep.

Create tag synonyms

Badges

Newest

Yearling

Next badge

68/80

Impact

68 posts edited

5 helpful flags

21 votes cast

15 Questions

Votes Activity Newest Views

votes

answers

views

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

Jan 20 '18 at 1:53 Michael Wehar 4,139

votes

answer

206

views

Can $\log^k n$ alternations be simulated in $\mathsf{NC}^k$?

cc.complexity-theory complexity-classes structural-complexity

Dec 2 '16 at 8:50 Jan Johannsen 4,429

vote

answers

217

views

Is $\mathsf{NP}$ in $\mathsf{NNC}^1$?

cc.complexity-theory complexity-classes

Oct 30 '15 at 20:47 argentpepper 2,211

votes

answers

120

views

What is the problem of finding a largest subset of smallest Kolmogorov complexity?

cc.complexity-theory it.information-theory kolmogorov-complexity

Aug 7 '15 at 20:15 argentpepper 2,211

votes

answer

182

views

What do you call the join of two optimization problems?

cc.complexity-theory optimization

Jul 24 '15 at 11:05 Peter Shor 22.6k

votes

answer

183

views

What is the relationship between $\mathsf{PLS}$ and $\mathsf{APX}$?

cc.complexity-theory approximation-algorithms

May 25 '14 at 21:22 Rahul Savani 1,663

votes

answers

144

views

Looking for an “additive” binary graph operation that preserves subgraphs of high degree

graph-theory

Jun 15 '13 at 3:55 argentpepper 2,211

votes

answers

319

views

Does Dinur's proof of PCP Theorem imply a procedure for reconstructing a witness?

cc.complexity-theory approximation-hardness pcp

Apr 8 '13 at 19:17 argentpepper 2,211

votes

answers

views

What is the query and randomness complexity for very efficient PCPs?

cc.complexity-theory pcp

Feb 20 '13 at 22:02 argentpepper 2,211

votes

answers

385

views

Interesting PCP characterization of classes smaller than P?

cc.complexity-theory complexity-classes pcp

Jan 9 '13 at 20:38 argentpepper 2,211

votes

answers

176

views

Complexity of computing logarithm of a prime power

cc.complexity-theory time-complexity nt.number-theory primes

Nov 11 '12 at 6:45 Community♦ 1

votes

answers

134

views

What is the relationship between $\mathsf{L}$ reductions and $\mathsf{NC}$ reductions?

cc.complexity-theory dc.parallel-comp reductions

Jun 22 '12 at 18:27 argentpepper 2,211

votes

answer

640

views

What is $\mathsf{NP}$ restricted to linear size witnesses?

cc.complexity-theory complexity-classes np

May 9 '12 at 20:50 Community♦ 1

votes

answer

860

views

Does $\mathsf{EXP}=\mathsf{NEXP}$ imply $\mathsf{E}=\mathsf{NE}$?

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

Mar 26 '12 at 11:21 András Salamon 18.3k

votes

answer

298

views

Approximation schemes for P-complete problems?

reference-request approximation-algorithms optimization

Feb 6 '12 at 16:40 argentpepper 2,211

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

15 Questions

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

Can $\log^k n$ alternations be simulated in $\mathsf{NC}^k$?

Is $\mathsf{NP}$ in $\mathsf{NNC}^1$?

What is the problem of finding a largest subset of smallest Kolmogorov complexity?

What do you call the join of two optimization problems?

What is the relationship between $\mathsf{PLS}$ and $\mathsf{APX}$?

Looking for an “additive” binary graph operation that preserves subgraphs of high degree

Does Dinur's proof of PCP Theorem imply a procedure for reconstructing a witness?

What is the query and randomness complexity for very efficient PCPs?

Interesting PCP characterization of classes smaller than P?

Complexity of computing logarithm of a prime power

What is the relationship between $\mathsf{L}$ reductions and $\mathsf{NC}$ reductions?

What is $\mathsf{NP}$ restricted to linear size witnesses?

Does $\mathsf{EXP}=\mathsf{NEXP}$ imply $\mathsf{E}=\mathsf{NE}$?

Approximation schemes for P-complete problems?