Samuel Schlesinger

GitHub
samuelgiuseppe.com
Amherst, MA, United States
Member for 5 years, 2 months

Reputation

1,622

1.6k
1.1k
607

2018
2019
2020
2021

Top tag

boolean-functions

Next privilege

2,000 Rep.

Edit questions and answers

Badges

Newest

Yearling

Next badge

18/30

Impact

0 posts edited

7 helpful flags

137 votes cast

22 Questions

Votes Activity Newest Views

votes

answers

758

views

Formally Verified Complexity Theory

Apr 18 '20 at 17:57 Clément 151

votes

answers

727

views

Are There Highly Symmetric NP- or P-complete Languages?

np algebra gr.group-theory complexity symmetry

Mar 17 '17 at 5:15 David Eppstein 50k

votes

answer

254

views

For any two non-isomorphic graphs $G, H$, does there exist a polysize, polylog quantifier depth first order formula which witnesses this?

graph-theory graph-isomorphism formulas first-order-logic

Nov 5 '17 at 17:54 Daniil Musatov 546

votes

answer

212

views

Has there been any progress in tightening the exponent in the result that polylog independence fools $AC_0$?

boolean-functions fourier-analysis

Dec 31 '18 at 2:51 Clement C. 4,083

votes

answers

669

views

What are examples of how non-uniformity can be useful?

circuit-complexity advice-and-nonuniformity

Apr 19 '18 at 14:52 Sasho Nikolov 17.9k

votes

answer

189

views

What is the probability that a random Boolean function has a trivial automorphism group?

boolean-functions randomness gr.group-theory symmetry

Jan 25 '18 at 9:08 Joshua Grochow 34.8k

votes

answers

167

views

Complexity of Computing Lexicographically Minimal Element of Orbit

permutations gr.group-theory complexity

Mar 13 '17 at 18:20 Boson 550

votes

answer

180

views

Sampling monotone Boolean functions

boolean-functions sample-complexity monotone

May 21 '19 at 23:18 mhum 3,324

votes

answer

238

views

What are some problems in $P$ which have lower bounds assuming that $P \neq NP$ or the ETH?

np-hardness lower-bounds

Sep 18 '17 at 21:20 Lieuwe Vinkhuijzen 1,572

votes

answers

139

views

Has what I am calling "helpfulness" here been studied?

reference-request circuit-complexity boolean-functions

Mar 15 '18 at 20:38 Samuel Schlesinger 1,622

votes

answer

126

views

Which $SIZE$-$DEPTH(s, d)$ classes with $log(s(n))^{d(n) - 1} = o(n)$ can we not separate by known methods?

circuit-complexity lower-bounds parity

Jul 18 '18 at 15:09 Bjørn Kjos-Hanssen♦ 4,318

votes

answers

144

views

Is there any notion of sensitivity for probabilistic Boolean functions?

circuits probabilistic-circuits

Oct 25 '17 at 3:40 Bjørn Kjos-Hanssen♦ 4,318

votes

answers

242

views

One Generalization of Graph Isomorphism Problem

graph-theory graph-algorithms graph-isomorphism

Apr 30 '18 at 15:09 Joshua Grochow 34.8k

votes

answers

views

Can we compute encodings of binary strings under arbitrary permutation groups?

permutations gr.group-theory circuits

Mar 19 '18 at 22:29 Samuel Schlesinger 1,622

votes

answers

122

views

What are some known methods for showing that a class has no complete problems?

cc.complexity-theory np p-vs-np

Oct 13 '17 at 2:24 Samuel Schlesinger 1,622

votes

answers

views

Module Independence Graphs

finite-fields

Mar 24 '17 at 2:57 Stella Biderman 1,026

vote

answer

135

views

How good of an approximate 2-coloring can you get of the halved cube graph?

graph-theory boolean-functions graph-colouring approximation

Mar 6 '18 at 7:23 Mikhail Rudoy 2,708

vote

answer

views

What is the relationship between this notion of symmetry compressibility and Kolmogorov complexity?

kolmogorov-complexity permutations gr.group-theory symmetry

Feb 2 '18 at 8:32 Joshua Grochow 34.8k

vote

answer

142

views

Is $CAPP \in P$ known to collapse some quantum complexity classes to classical ones?

quantum-computing circuit-complexity

Dec 13 '17 at 9:22 Ashley Montanaro 1,983

vote

answers

views

What is the average sensitivity of a quantum circuit with depth $d$ and size $s$?

quantum-computing circuit-complexity quantum-information probabilistic-circuits

Nov 1 '17 at 2:29 Samuel Schlesinger 1,622

vote

answers

228

views

What progress is being made on $NP \cap coNP$ having complete problems? [closed]

cc.complexity-theory open-problem

May 1 '17 at 18:22 Mr. 11.8k

-1

votes

answer

291

views

What is the connection between adversarial learning in machine learning and program synthesis?

cc.complexity-theory ds.algorithms machine-learning adversarial-learning

Mar 29 '17 at 20:33 D.W. 10.1k

Stack Exchange Network

current community

your communities

more stack exchange communities

Next privilege

Next badge

22 Questions

Formally Verified Complexity Theory

Are There Highly Symmetric NP- or P-complete Languages?

For any two non-isomorphic graphs $G, H$, does there exist a polysize, polylog quantifier depth first order formula which witnesses this?

Has there been any progress in tightening the exponent in the result that polylog independence fools $AC_0$?

What are examples of how non-uniformity can be useful?

What is the probability that a random Boolean function has a trivial automorphism group?

Complexity of Computing Lexicographically Minimal Element of Orbit

Sampling monotone Boolean functions

What are some problems in $P$ which have lower bounds assuming that $P \neq NP$ or the ETH?

Has what I am calling "helpfulness" here been studied?

Which $SIZE$-$DEPTH(s, d)$ classes with $log(s(n))^{d(n) - 1} = o(n)$ can we not separate by known methods?

Is there any notion of sensitivity for probabilistic Boolean functions?

One Generalization of Graph Isomorphism Problem

Can we compute encodings of binary strings under arbitrary permutation groups?

What are some known methods for showing that a class has no complete problems?

Module Independence Graphs

How good of an approximate 2-coloring can you get of the halved cube graph?

What is the relationship between this notion of symmetry compressibility and Kolmogorov complexity?

Is $CAPP \in P$ known to collapse some quantum complexity classes to classical ones?

What is the average sensitivity of a quantum circuit with depth $d$ and size $s$?

What progress is being made on $NP \cap coNP$ having complete problems? [closed]

What is the connection between adversarial learning in machine learning and program synthesis?