<--- Back to Details
First PageDocument Content
Complexity classes / Decision problem / P versus NP problem / NP-complete / NP / Polynomial / Boolean satisfiability problem / Time complexity / 2-satisfiability / Theoretical computer science / Computational complexity theory / Applied mathematics
Date: 2008-02-01 12:23:22
Complexity classes
Decision problem
P versus NP problem
NP-complete
NP
Polynomial
Boolean satisfiability problem
Time complexity
2-satisfiability
Theoretical computer science
Computational complexity theory
Applied mathematics

Add to Reading List

Source URL: stationq.cnsi.ucsb.edu

Download Document from Source Website

File Size: 207,16 KB

Share Document on Facebook

Similar Documents

SoK: Deep Packer Inspection: A Longitudinal Study of the Complexity of Run-Time Packers Xabier Ugarte-Pedrero∗ , Davide Balzarotti† , Igor Santos∗ , Pablo G. Bringas∗ ∗ DeustoTech, University of Deusto

DocID: 1v9SC - View Document

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

DocID: 1v8bH - View Document

J Real-Time Image Proc:5–24 DOIs11554SPECIAL ISSUE PAPER Complexity control of HEVC encoders targeting real-time

DocID: 1uq0O - View Document

Software engineering / Computer programming / Computing / Functional languages / Data types / Type theory / Logic in computer science / Automated theorem proving / OCaml / Coq / Disjoint-set data structure / Proof assistant

Journal of Automated Reasoning manuscript No. (will be inserted by the editor) Verifying the Correctness and Amortized Complexity of a Union-Find Implementation in Separation Logic with Time Credits

DocID: 1umuY - View Document

A Gentle Introduction to the Time Complexity Analysis of Evolutionary Algorithms Pietro S. Oliveto Department of Computer Science The University of Sheffield, Sheffield, UK email:

DocID: 1uaFl - View Document