<--- Back to Details
First PageDocument Content
Elementary mathematics / Cardinal numbers / Boolean algebra / Mathematical optimization / Integer / Finite set / NP / Cardinality / Boolean satisfiability problem / Mathematics / Theoretical computer science / Complexity classes
Date: 2010-02-08 11:12:45
Elementary mathematics
Cardinal numbers
Boolean algebra
Mathematical optimization
Integer
Finite set
NP
Cardinality
Boolean satisfiability problem
Mathematics
Theoretical computer science
Complexity classes

On Decision Procedures for Ordered Collections

Add to Reading List

Source URL: lara.epfl.ch

Download Document from Source Website

File Size: 208,18 KB

Share Document on Facebook

Similar Documents

New York Journal of Mathematics New York J. Math–243. Unions of arcs from Fourier partial sums Dennis Courtney Abstract. Elementary complex analysis and Hilbert space methods

DocID: 1tH06 - View Document

New York Journal of Mathematics New York J. Math–243. Unions of arcs from Fourier partial sums Dennis Courtney Abstract. Elementary complex analysis and Hilbert space methods

DocID: 1tGVZ - View Document

School Report St. Joseph Catholic Elementary SchoolSchool Report Assessments of Reading, Writing and Mathematics

DocID: 1tp6H - View Document

New York Journal of Mathematics New York J. Math–469. An elementary approach to C ∗-algebras associated to topological graphs Hui Li, David Pask and Aidan Sims

DocID: 1toIK - View Document

School Report St. Elizabeth Catholic Elementary SchoolSchool Report Assessments of Reading, Writing and Mathematics

DocID: 1tlKa - View Document