Theoretical Computer Science
Jake's user avatar
Jake's user avatar
Jake's user avatar
Jake
  • Member for 3 years, 1 month
  • Last seen more than a month ago
  • United States
Profile Activity
Stats
1,204
reputation
46
reached
0
answers
1
question
Communities
View all
About

Main interests: circuit complexity theory (specifically $CC^0$ circuits), formal logic, implicit computational complexity theory

Badges
View all badges
This user doesn’t have any gold badges yet.
3
silver badges
4
bronze badges
Top tags
0
Score
1
Posts
100
Posts %
Top posts
All Questions Answers
Score Newest
question
2
What to do with lengthy partial progress
Oct 17, 2021
Top network posts
View all network posts
11
Existence of injective length-preserving rational function to a smaller alphabet
11
Check whether DFA accepts majority of words less than a cutoff with another DFA
10
Can exponential-size depth-2 $CC^0[m]$ circuits with generalized $MOD_m$ gates compute arbitrary functions from $Z/mZ$ to $Z/2Z$?
9
Proof of $DLOGTIME-CC^0 = MOD[<,bit]$
8
Construction of arbitrary functions with exponential-size $MODp \circ MODq$ circuits

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.