Skip to main content
Computer Science
Joe Bebel's user avatar
Joe Bebel's user avatar
Joe Bebel's user avatar
Joe Bebel
  • Member for 9 years, 9 months
  • Last seen more than 2 years ago
  • University of Southern California
Profile Activity
Stats
226
reputation
3k
reached
3
answers
0
questions
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
This user doesn’t have any gold badges yet.
1
silver badge
4
bronze badges
Top tags
7
Score
2
Posts
67
Posts %
6
Score
1
Posts
33
Posts %
6
Score
1
Posts
33
Posts %
4
Score
1
Posts
33
Posts %
1
Score
1
Posts
33
Posts %
1
Score
1
Posts
33
Posts %
Top posts
answer
6
Conjectured NP-complete problems
Nov 19, 2015
answer
4
What is the difference between dynamic programming and a mere caching?
Nov 19, 2015
answer
1
Can finding a witness be NP-hard even if we already know there is one?
Mar 17, 2015
Top network posts
View all network posts
43
Is it a rule that discrete problems are NP-hard and continuous problems are not?
22
Time complexity with irrational exponent?
15
How much would a SAT oracle help speeding up polynomial time algorithms?
14
Concentration bounds for sums of random variables of permutations
12
Is there a natural problem in quasi-polynomial time, but not in polynomial time?