User Samuel Schlesinger - Theoretical Computer Science Stack Exchange

Results from the 2022 Developer Survey are now available

Samuel Schlesinger

Member for 5 years, 11 months
Last seen more than a month ago

GitHub
samuelgiuseppe.com
Amherst, MA, United States

7 Answers

Score Activity Newest

2 votes

What are semantic classes that have a syntactic equivalent?

cc.complexity-theory complexity-classes big-list

answered Mar 11, 2018 at 17:51

2 votes

Accepted

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

answered Mar 3, 2018 at 3:10

4 votes

Checking formulas with two quantifiers ($\forall \exists$) - 2QBF

ds.algorithms lo.logic sat boolean-functions

answered Nov 14, 2017 at 18:11

6 votes

Why is the multi-step reduction of semantics reflexive?

pl.programming-languages lambda-calculus semantics

answered Mar 14, 2017 at 18:42

3 votes

Formally proving no algorithm exists

proofs complexity

answered Mar 12, 2017 at 20:43

-1 votes

Evidence that PPAD is hard?

cc.complexity-theory complexity-classes gt.game-theory conditional-results

answered Jan 28, 2017 at 16:02

1 vote

Subtypes as subsets of SML datatypes

type-theory type-inference

answered Jul 26, 2016 at 0:51