This class was created by Brainscape user YuvG B. Visit their profile to learn more about the creator.

By:
YuvG B

- decks
- flashcards
- learners

Modular Arithmetic

Write a recursive,

What is the running time of mult x y,

Write the algorithm for recdivide

27
cards

RSA

Write the rsa properties,

Prove the rsa properties,

Why is rsa secured

3
cards

Fast multiplication algorithm

What,

Explain why the run time is t n 3...,

Why the naive recursive algorithm...

4
cards

The fast Fourier transform

What is the degree of the product...,

Naively how much time does it tak...,

How the fact the a degree d polyn...

24
cards

Linear Programming

How do you turn a max lp problem ...,

How,

How to change an inequality const...

49
cards

Multiplicative Weights

Describe the problem of multiplic...,

Condition 1 one of the experts is...,

Condition 2 all the experts are w...

17
cards

Finding subgraphs

Assume g has n vertices and h has...,

Write the naive algorithm for fin...

23
cards

Approximate Distance Oracle

What is the functionality of the,

Assume we want to compute all pai...,

13
cards

Quantum

Explain the epr paradox

41
cards

Algorithms 2

- Class purpose General learning

Learn faster with Brainscape on your web, iPhone, or Android device. Study YuvG B's Algorithms 2 flashcards for their Ben Gurion University class now!

Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.

Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!

Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.

We use an adaptive study algorithm that is proven to help you learn faster and remember longer....

- 13 decks
- 342 flashcards
- 127 learners

Decks:
Python Built In Data Structures, Python User Defined Data Structures, Python List Methods, And more!