MathOverflow
Joe Bebel's user avatar
Joe Bebel's user avatar
Joe Bebel's user avatar
Joe Bebel
  • Member for 13 years, 7 months
  • Last seen more than a week ago
  • University of Southern California
Profile Activity
Stats
539
reputation
7k
reached
3
answers
6
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
View all badges
This user doesn’t have any gold badges yet.
2
silver badges
11
bronze badges
Top tags
View all tags
5
Score
3
Posts
33
Posts %
4
Score
2
Posts
22
Posts %
4
Score
1
Posts
11
Posts %
3
Score
2
Posts
22
Posts %
3
Score
1
Posts
11
Posts %
2
Score
2
Posts
22
Posts %
Top posts
question
14
Concentration bounds for sums of random variables of permutations
Jan 29, 2013
question
7
Subgroup ranks of the symmetric group
Jun 9, 2016
question
6
Nonclassical polynomials, circles, and groups
Dec 16, 2015
question
4
Iwasawa logarithm and analytic continuation
Jun 28, 2014
answer
4
Why are smooth numbers called "smooth"?
May 26, 2014
answer
3
Finite objects for which isomorphism is NP-hard or harder?
May 20, 2016
question
2
Polynomial degree comparison of Nullstellensatz and Positivstellensatz over real algebraic sets
Mar 21, 2015
answer
2
Constructing hard inputs for the complement of bounded halting
Mar 21, 2015
question
1
Can a polynomial be evaluated from evaluations of partial interpolations? (Or: can the unique solution of congruences be written in a certain way?)
May 14, 2021
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?
12
Finding the sparsest solution to a system of linear equations
12
Is there a natural problem in quasi-polynomial time, but not in polynomial time?