(Complete Item Description)
- Abstract:
-
A book introducing basic concepts from computational number theory and algebra, including all the necessary mathematical background.
- Subject:
-
Mathematics and Statistics
- Grade Level:
-
Post-secondary
- Collection:
-
Individual Authors
Rate this resource by using the left and right arrow keys and pressing Enter.
Share Only
(Complete Item Description)
- Abstract:
-
Studies how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Models of randomized computation. Data structures: hash tables, and skip lists. Graph algorithms: minimum spanning trees, shortest paths, and minimum cuts. Geometric algorithms: convex hulls, linear programming in fixed or arbitrary dimension. Approximate counting; parallel algorithms; online algorithms; derandomization techniques; and tools for probabilistic analysis of algorithms.
- Subject:
-
Science and Technology
- Grade Level:
-
Post-secondary
- Collection:
-
MIT OpenCourseWare
Rate this resource by using the left and right arrow keys and pressing Enter.
Remix and Share
No restrictions on your remixing, redistributing, or making derivative works. Give credit to the author, as required.
Your remixing, redistributing, or making derivatives works comes with some restrictions, including how it is shared.
Your redistributing comes with some restrictions. Do not remix or make derivative works.
Copyrighted materials, available under Fair Use and the TEACH Act for US-based educators, or other custom arrangements. Go to the resource provider to see their individual restrictions.