Theoretical Computer Science
Joe Bebel
  • University of Southern California
  • Member for 9 years, 6 months
Profile Activity
Stats
2,265
reputation
31k
reached
24
answers
1
questions
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.

Communities (12)

Top network posts

This user doesn’t have any gold badges yet.
16
silver badges
17
bronze badges
View all badges

Top tags (46)

Score 125
Posts 11
Posts % 44
Score 43
Posts 2
Score 42
Posts 2
Score 39
Posts 3
Score 27
Posts 3
Score 26
Posts 2
View all tags →

Top posts (25)

All Questions Answers
Votes Newest
42 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
11 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 Obituaries of dead conjectures Oct 7 '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
View all questions and answers →

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.