We’re rewarding the question askers & reputations are being recalculated! Read more.
Theoretical Computer Science
Meta user
Network profile
2,235
reputation
14
16

Joe Bebel

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.

24
answers
1
question
~26k
people reached
  • University of Southern California
  • Member for 7 years, 7 months
  • 296 profile views
  • Last seen Nov 6 at 10:25

Communities (11)

Top network posts

Top tags (46)

Score 123
Posts 11
Posts % 44
Score 42
Posts 2
Score 41
Posts 2
Score 38
Posts 3
Score 27
Posts 3
Score 25
Posts 2
View all tags →

Top posts (25) All Questions Answers | Votes Newest

41 Is it a rule that discrete problems are NP-hard and continuous problems are not? Apr 7 '15
22 Time complexity with irrational exponent? Sep 27 '15
15 How much would a SAT oracle help speeding up polynomial time algorithms? Sep 29 '15
12 Finding the sparsest solution to a system of linear equations Dec 16 '15
10 Is there a natural problem in quasi-polynomial time, but not in polynomial time? Apr 22 '16
10 Is a quadratic nondeterminism speed-up of deterministic computation plausible? Apr 28 '16
9 For which problems in P is it easier to verify the result than to find it? Nov 3 '15
8 Is graph isomorphism still open for bounded clique width or bounded rank width? 2015 paper claims it is polynomial Dec 20 '15
7 Can we confirm that 2-SAT can indeed be transformed into Horn-SAT in this manner? Dec 3 '15
7 Obituaries of dead conjectures Oct 7 '15
View all questions and answers →

Badges (30)

Gold

—

Silver

14

Rarest

Bronze

16

Rarest

View all badges →