User Samuel Schlesinger

Samuel Schlesinger

Member for 7 years, 4 months
Last seen more than a month ago

GitHub
samuelgiuseppe.com
Amherst, MA, United States

Stats

1,572

reputation

reached

answers

questions

Loading…

Communities

View all

About

I'm a student currently focused on complexity theory and algorithmic game theory

Badges

View all badges

This user doesn’t have any gold badges yet.

silver badges

Good Question

Apr 28, 2021
Yearling

× 7

Jul 26

bronze badges

Tumbleweed

Feb 7, 2018
Promoter

Nov 26, 2021
Curious

Oct 7, 2017

Top tags

View all tags

boolean-functions

Score

Posts

Posts %

complexity

Score

Posts

Posts %

circuit-complexity

Score

Posts

Posts %

lower-bounds

Score

Posts

Posts %

cc.complexity-theory

Score

Posts

Posts %

gr.group-theory

Score

Posts

Posts %

Top posts

View all questions and answers

All Questions Answers

Score Newest

Formally Verified Complexity Theory

Nov 13, 2017

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

Mar 13, 2017

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

Oct 25, 2017

Complexity of Computing Lexicographically Minimal Element of Orbit

Mar 12, 2017

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

Jan 24, 2018

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

Apr 18, 2018

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

Apr 24, 2018

Sampling monotone Boolean functions

May 21, 2019

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

Sep 18, 2017

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

Mar 15, 2018