MathOverflow will be down for maintenance for approximately 3 hours, starting Monday evening (06/24/2013) at approximately 9:00 PM Eastern time (UTC-4).

AVS

560

Reputation

451 views

Registered User

Name	AVS
Member for	3 years
Seen	Jul 6 at 12:28
Website	math.mit.edu/~drew
Location	Massachusetts Institute of Technology
Age

stats recent reputation favorites

0

Questions

9

Answers

votes newest views recent

Fast computation of multiplicative inverse modulo q

Where can I find a comprehensive list of equations for small genus modular curves?

Is there a good known algorithm for generating sets of monomials? (Alternatively, what is the fastest known algorithm for generating integer partitions?)

A question on liftings of supersingular elliptic curves over the prime fields

The limits of parallelism

Need Algorithm to generate all permutations of the integers 1 to n

Applications of the Chinese remainder theorem

Second stage of elliptic curve factorization via random walk/Pollard’s rho in constant (or low) memory?

Computationally bounding a curve’s genus from below?

93

Votes

91

2

14

Tags

nt.number-theory× 6
algorithms× 2
ag.algebraic-geometry× 2
random-walk
modular-forms
galois-representations
factorization
examples
elliptic-curves
computer-science

computational-number-theo
computational-complexity
big-list
applications

11

Badges

● Yearling× 2
● Citizen Patrol

● Nice Answer× 2
● Commentator

● Enthusiast
● Editor

● Critic
● Supporter