Back to Results
First PageMeta Content
Computational complexity theory / Analysis of algorithms / Algorithm / Mathematical logic / Time complexity / Pi / Big O notation / Baby-step giant-step / Factorial / Theoretical computer science / Mathematics / Applied mathematics


Order Computations in Generic Groups by
Add to Reading List

Document Date: 2007-05-19 16:49:47

Open Document

File Size: 739,11 KB

Share Result on Facebook

Company

Abelian Group / Alar Toomre / /

Facility

Massachusetts Institute of Technology / MASSACHUSETTS INSTITUTE OF TECHNOLOGY June / /

IndustryTerm

generic / generic algorithm / non-generic algorithms / generic algorithms / /

Organization

Department Committee / Department of Mathematics / Massachusetts Institute of Technology / /

Person

Andrew V. Sutherland / Pavel I. Etingof / Applied Mathematics / Michael F. Sipser / Andrew V. Sutherland Submitted / /

Position

author / Professor of Applied Mathematics Thesis Supervisor / Professor of Applied Mathematics / Chairman / Thesis Supervisor / /

ProvinceOrState

Massachusetts / /

Technology

Structure Algorithm / generic algorithm / Snowball Algorithm / 139 9.1 Existing Algorithms / Order Algorithms / non-generic algorithms / Linear-Time Algorithm / Primorial-Steps Algorithm / Subexponential Algorithms / Classical Algorithm / 31 2.1 Analyzing Order Algorithms / 38 Existing Order Algorithms / /

SocialTag