<--- Back to Details
First PageDocument Content
Boolean algebra / Conjunctive normal form / Disjunctive normal form / Implicant / Decision list / IP / FO / Time complexity / Boolean satisfiability problem / Theoretical computer science / Computational complexity theory / Mathematics
Date: 2013-06-02 16:27:23
Boolean algebra
Conjunctive normal form
Disjunctive normal form
Implicant
Decision list
IP
FO
Time complexity
Boolean satisfiability problem
Theoretical computer science
Computational complexity theory
Mathematics

Add to Reading List

Source URL: people.csail.mit.edu

Download Document from Source Website

File Size: 946,33 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