<--- Back to Details
First PageDocument Content
Complexity classes / NP-complete / NP-hard / P versus NP problem / NP / Cook–Levin theorem / Boolean satisfiability problem / PP / P / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2014-01-08 09:09:08
Complexity classes
NP-complete
NP-hard
P versus NP problem
NP
Cook–Levin theorem
Boolean satisfiability problem
PP
P
Theoretical computer science
Computational complexity theory
Applied mathematics

Motivation COMS21103 NP-completeness

Add to Reading List

Source URL: www.cs.bris.ac.uk

Download Document from Source Website

File Size: 240,24 KB

Share Document on Facebook

Similar Documents

Computational neuroscience / Neural networks / Artificial neural networks / Neuroscience / Cybernetics / Nervous system / Spiking neural network / Neuron / Artificial neuron / Nervous system network models / GalvesLcherbach model

Compositional Semantics of Spiking Neural P Systems Roberto Barbutia , Andrea Maggiolo-Schettinia, Paolo Milazzoa,∗, Simone Tinib a Dipartimento di Informatica, Universit` a di Pisa, Largo B. Pontecorvo 3, 56127 Pisa,

DocID: 1xW1Z - View Document

Cloud infrastructure / IBM cloud computing / Computing / Cloud computing

InsFtute
of
Molecular
Systems
Biology

 Accelerating 3D Protein Modeling Using Cloud Computing 
 Lars
Malmström,
Ruedi
Aebersold
–
ETH
Zürich,
IMSB
h?p://www.imsb.ethz.ch
 Wibke
Sud

DocID: 1xW13 - View Document

Expense / Political terminology / Lobbying in the United States / Lobbying / Public sphere

Form LR-ER Page 1 of 6 (RevMailing Address P.O. BoxRaleigh, NC

DocID: 1xW0N - View Document

Taxation in the United States / Expense / Lobbying in the United States / 501(c) organization

-1905014478000488115479555Mailing Address P.O. BoxRaleigh, NCWeb: https://lobby.ncsbe.gov/lobbying Phone: (

DocID: 1xVZ5 - View Document

Elections / Voting / Politics / Group decision-making / Ballot / Write-in candidate / Electronic voting / Vote counting / Optical scan voting system / Spoilt vote

Election Tuesday, Polling Hours: 6:30 a.m. to 7:30 p.m.

DocID: 1xVYO - View Document