Theoretical Computer Science
Russell Easterly's user avatar
Russell Easterly's user avatar
Russell Easterly's user avatar
Russell Easterly
  • Member for 12 years, 5 months
  • Last seen more than a month ago
Profile Activity
Stats
549
reputation
3k
reached
5
answers
7
questions
Communities
Badges
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
10
bronze badges
Top tags
View all tags
4
Score
3
Posts
25
Posts %
2
Score
5
Posts
42
Posts %
2
Score
3
Posts
25
Posts %
2
Score
2
Posts
17
Posts %
2
Score
2
Posts
17
Posts %
2
Score
2
Posts
17
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
13
Comparing the Kolmogorov complexity of theories
Feb 3, 2015
question
9
MAX 1 in 2 SAT Algorithm
Aug 22, 2014
question
6
Comparing the Kolmogorov complexity of theories - Part 2
Feb 24, 2015
question
6
What is the Kolmogorov complexity of arithmetic?
May 5, 2015
question
3
Independent Sets that are Odd Covers
May 20, 2014
answer
2
Short UNSAT Certificates for X3SAT
Mar 15
question
2
Short UNSAT Certificates for X3SAT
May 18, 2022
answer
2
How hard is counting the number of vertex covers after a small perturbation?
Apr 28, 2011
answer
0
Weighted SAT: is this a known problem?
Jul 15, 2013
answer
-1
Complexity of applying a permutation in-place
May 24, 2011
Top network posts
View all network posts
30
Even XOR Odd Infinities?
10
How does induction fail in computable nonstandard models?
10
What is wrong with this simple proof of P=NP?
9
Can A Decidable Theory Have Nonrecursive Models?
8
Is there a natural bijection from $\mathbb{N}$ to $\mathbb{Q}$?

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.