Complete Boolean algebra - PDFSEARCH.IO - Document Search Engine

Complete Boolean algebra
Results: 108

#	Item
1	On Solving Boolean Multilevel Optimization Problems∗ Josep Argelich INESC-ID Lisbon Add to Reading List Source URL: www.mancoosi.org Language: English - Date: 2012-12-16 04:54:55 Theoretical computer science Mathematics Computational complexity theory Operations research Logic in computer science Mathematical optimization NP-complete problems Boolean algebra Maximum satisfiability problem Boolean satisfiability problem Constraint satisfaction Solver
2	Curriculum Vitae: Alexis C. Kaporis Contact information Address : Phone: Add to Reading List Source URL: students.ceid.upatras.gr Language: English - Date: 2006-02-09 03:56:19 Theoretical computer science Computational complexity theory Mathematics Logic in computer science NP-complete problems Boolean algebra Boolean satisfiability problem Electronic design automation Symposium on Discrete Algorithms Approximation algorithm Random walk 2-satisfiability
3	No complete linear term rewriting system for propositional logic Anupam Das and Lutz Straßburger Abstract Recently it has been observed that the set of all sound linear inference rules in propositional Add to Reading List Source URL: www.lix.polytechnique.fr Language: English - Date: 2015-03-23 07:14:32 Mathematics Logic Mathematical logic Boolean algebra Formal languages Semantics Algebraic logic Logic in computer science Substitution Propositional calculus Rewriting Negation
4	Microsoft Word - IBSdoc Add to Reading List Source URL: foibg.com Language: English - Date: 2015-02-02 08:44:10 Theoretical computer science Mathematical logic Mathematics Logic in computer science NP-complete problems Boolean algebra Electronic design automation Algebraic logic Tseytin transformation Boolean satisfiability problem Conjunctive normal form Canonical normal form
5	Introduction & Motivation Relations and Operations Boolean and 3-element cases Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-08-14 00:50:42 Computational complexity theory Complexity classes Theory of computation FO PSPACE SO P EXPTIME Boolean algebra Co-NP-complete Reduction Descriptive complexity theory
6	Continued Relevance of Bit-Level Verification Research R. Brayton, N. Een, A. Mishchenko Berkeley Verification and Synthesis Research Center EECS Dept., University of California, Berkeley Introduction Add to Reading List Source URL: fm.csl.sri.com Language: English - Date: 2010-10-30 02:14:08 Theoretical computer science Formal methods Logic in computer science Electronic design automation NP-complete problems Boolean algebra Boolean satisfiability problem Solver Formal equivalence checking Formal verification Model checking Uclid
7	Complexity and Approximability of Parameterized MAX-CSPs Holger Dell1 , Eun Jung Kim2 , Michael Lampis3 , Valia Mitsou4 , and Tobias Mömke5 1 Add to Reading List Source URL: drops.dagstuhl.de Language: English - Date: 2015-11-09 10:22:02 Theoretical computer science Computational complexity theory Mathematics Constraint programming NP-complete problems Boolean algebra Parameterized complexity Boolean satisfiability problem Constraint satisfaction problem Exponential time hypothesis Treewidth Tree decomposition
8	Abstraction-Based Algorithm for 2QBF Mikol´asˇ Janota2 and Joao Marques-Silva1,2 1 University College Dublin, Ireland 2 Add to Reading List Source URL: www.mancoosi.org Language: English - Date: 2012-12-16 04:54:55 Logic in computer science Boolean algebra Electronic design automation Formal methods NP-complete problems Boolean satisfiability problem True quantified Boolean formula Maximum satisfiability problem Model checking Conjunctive normal form Satisfiability Tseytin transformation
9	Overt Subspaces of Rn Paul Taylor 29 June 2014 This is a rough draft Add to Reading List Source URL: www.paultaylor.eu Language: English - Date: 2014-06-29 16:29:38 General topology Subspace topology Continuous function Base Metric space Compact space Banach space Coherent topology Complete metric space Sheaf Boolean algebra Topological space
10	Economics and Computation ECONand CPSCProfessor Dirk Bergemann and Professor Joan Feigenbaum Lecture IV Add to Reading List Source URL: zoo.cs.yale.edu Language: English - Date: 2008-10-07 04:07:53 Complexity classes Computational complexity theory Boolean algebra Structural complexity theory NP-complete problems Boolean satisfiability problem NP PP Reduction True quantified Boolean formula Exponential time hypothesis P