Theoretical Computer Science
Joe Bebel's user avatar
Joe Bebel's user avatar
Joe Bebel's user avatar
Joe Bebel
  • Member for 11 years, 8 months
  • Last seen more than a month ago
  • University of Southern California
Profile Activity
Stats
2,295
reputation
34k
reached
24
answers
1
question
top 9% overall
Communities
View all
About

I am a Ph.D student in the Department of Computer Science at the University of Southern California, in Los Angeles, CA.

My advisor is Leonard Adleman.

Badges
View all badges
This user doesn’t have any gold badges yet.
18
silver badges
18
bronze badges
Top tags
View all tags
126
Score
11
Posts
44
Posts %
44
Score
2
Posts
8
Posts %
43
Score
2
Posts
8
Posts %
39
Score
3
Posts
12
Posts %
26
Score
3
Posts
12
Posts %
26
Score
2
Posts
8
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
43
Is it a rule that discrete problems are NP-hard and continuous problems are not?
Apr 7, 2015
answer
21
Time complexity with irrational exponent?
Sep 27, 2015
answer
15
How much would a SAT oracle help speeding up polynomial time algorithms?
Sep 29, 2015
answer
12
Finding the sparsest solution to a system of linear equations
Dec 16, 2015
answer
11
Is there a natural problem in quasi-polynomial time, but not in polynomial time?
Apr 22, 2016
answer
10
Is a quadratic nondeterminism speed-up of deterministic computation plausible?
Apr 28, 2016
answer
10
For which problems in P is it easier to verify the result than to find it?
Nov 3, 2015
answer
8
Is graph isomorphism still open for bounded clique width or bounded rank width? 2015 paper claims it is polynomial
Dec 20, 2015
answer
8
Obituaries of dead conjectures
Oct 7, 2015
answer
7
Can we confirm that 2-SAT can indeed be transformed into Horn-SAT in this manner?
Dec 3, 2015
Top network posts
View all network posts
14
Concentration bounds for sums of random variables of permutations
11
Differential equations with rational functions as solution
7
Subgroup ranks of the symmetric group
6
Nonclassical polynomials, circles, and groups
6
Conjectured NP-complete problems

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.