<--- Back to Details
First PageDocument Content
Complexity classes / Mathematical optimization / Operations research / Scheduling algorithms / Scheduling / NP / Interval scheduling / Graph coloring / Reduction / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2014-05-22 11:02:32
Complexity classes
Mathematical optimization
Operations research
Scheduling algorithms
Scheduling
NP
Interval scheduling
Graph coloring
Reduction
Theoretical computer science
Computational complexity theory
Applied mathematics

LNCS[removed]Interval Selection with Machine-Dependent Intervals

Add to Reading List

Source URL: www.coga.tu-berlin.de

Download Document from Source Website

File Size: 239,30 KB

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