Theoretical Computer Science
Samuel Schlesinger
  • Member for 5 years, 6 months
  • Last seen more than a month ago
Profile Activity
Stats
1,552
reputation
9k
reached
7
answers
24
questions
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.
6
silver badges
20
bronze badges
Top tags
View all tags
4
Score
7
Posts
23
Posts %
3
Score
4
Posts
13
Posts %
2
Score
8
Posts
26
Posts %
2
Score
3
Posts
10
Posts %
1
Score
7
Posts
23
Posts %
0
Score
5
Posts
16
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
27
Formally Verified Complexity Theory
Nov 13 '17
14
Are There Highly Symmetric NP- or P-complete Languages?
Mar 13 '17
12
For any two non-isomorphic graphs $G, H$, does there exist a polysize, polylog quantifier depth first order formula which witnesses this?
Oct 25 '17
9
Complexity of Computing Lexicographically Minimal Element of Orbit
Mar 12 '17
9
What is the probability that a random Boolean function has a trivial automorphism group?
Jan 24 '18
9
What are examples of how non-uniformity can be useful?
Apr 18 '18
9
Has there been any progress in tightening the exponent in the result that polylog independence fools $AC_0$?
Apr 24 '18
7
Sampling monotone Boolean functions
May 21 '19
7
What are some problems in $P$ which have lower bounds assuming that $P \neq NP$ or the ETH?
Sep 18 '17
6
Has what I am calling "helpfulness" here been studied?
Mar 15 '18
Top network posts
View all network posts
9
What can we say about the equivalence relation defined such that $G \sim H \Longleftrightarrow Aut(G) \simeq Aut(H)$?

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.