<--- Back to Details
First PageDocument Content
Analysis of algorithms / Time complexity / Randomized algorithm / Algorithm / Adversary model / Decision tree model / Big O notation / Binary search algorithm / NP / Theoretical computer science / Applied mathematics / Computational complexity theory
Date: 2014-12-28 08:41:16
Analysis of algorithms
Time complexity
Randomized algorithm
Algorithm
Adversary model
Decision tree model
Big O notation
Binary search algorithm
NP
Theoretical computer science
Applied mathematics
Computational complexity theory

Add to Reading List

Source URL: web.engr.illinois.edu

Download Document from Source Website

File Size: 2,44 MB

Share Document on Facebook

Similar Documents

Computational complexity theory / Cryptography / Complexity classes / Theory of computation / NP / IP / Advice / PP / P / Soundness / Commitment scheme / Certificate

Monotone Batch NP-Delegation with Applications to Access Control Zvika Brakerski∗ Yael Tauman Kalai†

DocID: 1xUdf - View Document

Quantum mechanics / Physics / Theoretical physics / Chemistry / Mathematical formulation of quantum mechanics / Quantum superposition / Unitary transformation / Quantum computing / Hamiltonian / Quantum algorithm / Degenerate energy levels / Schrdinger equation

Lecture 25, Thurs April 20: Hamiltonians Now we’ll move on to our second-to-last unit… Hamiltonians and the Adiabatic Algorithm We’ve seen how it’s an open question whether quantum computers can solve ​NP​-co

DocID: 1xTKi - View Document

PDF Document

DocID: 1xSVG - View Document

PDF Document

DocID: 1xSM6 - View Document

PDF Document

DocID: 1xSJs - View Document