Boolean - PDFSEARCH.IO - Document Search Engine

Boolean
Results: 2137

#	Item
751	J. Child Lang), 251–282. f 2007 Cambridge University Press doi:S0305000906007884 Printed in the United Kingdom What part of no do children not understand ? A usage-based account of multiword negation* Add to Reading List Source URL: www.eva.mpg.de Language: English - Date: 2015-03-17 09:04:37 Propositional calculus Baby talk Infancy Language acquisition Negation Language Linguistics Psycholinguistics Boolean algebra
752	Local reductions Hamid Jahanjou∗ Eric Miles∗ Emanuele Viola∗ Add to Reading List Source URL: www.ccs.neu.edu Language: English - Date: 2014-04-01 09:13:02 Complexity classes Circuit complexity Boolean algebra NP-complete problems Time complexity ACC0 Cook–Levin theorem P NC Theoretical computer science Computational complexity theory Applied mathematics
753	Journal of Artificial Intelligence Research234 Submitted 8/14; published 1/15 On the Subexponential-Time Complexity of CSP Ronald de Haan Add to Reading List Source URL: www.jair.org Language: English - Date: 2015-01-30 21:27:29 Constraint programming Constraint satisfaction problem Constraint satisfaction Exponential time hypothesis Boolean satisfiability problem NP-complete Tree decomposition Conjunctive normal form Time complexity Theoretical computer science Applied mathematics Computational complexity theory
754	A The Complexity of the Comparator Circuit Value Problem STEPHEN A. COOK, Department of Computer Science, University of Toronto YUVAL FILMUS, Department of Computer Science, University of Toronto DAI TRI MAN LÊ, Departm Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2014-04-02 14:14:13 Circuit complexity Computational complexity theory ACC0 FO Comparator Sorting network AC TC0 Boolean circuit Theoretical computer science Applied mathematics Complexity classes
755	Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds∗ Yuval Filmus University of Toronto Massimo Lauria Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2013-05-06 19:14:13 Computational complexity theory Conjunctive normal form Proof complexity PP IP Polynomial Boolean algebra Frege system MAX-3SAT Theoretical computer science Applied mathematics Logic in computer science
756	Configuration by Ovidiu Predescu, Jeff Turner NOTICE: Copyright © Ovidiu Predescu and Jeff Turner. All rights reserved. The Anteater manual may be reproduced and distributed in whole or in part, in any medium Add to Reading List Source URL: aft.sourceforge.net Language: English - Date: 2003-04-12 08:48:46 Markup languages Technical communication Boolean algebra Boolean data type XPath Apache Ant Computing Software XML
757	UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS FUNCTIONAL PROGRAMMING AND SPECIFICATION (LEVEL 9) Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2010-05-13 07:45:52 Computer programming Functional languages Propositional calculus Procedural programming languages FO Finite model theory Negation B-tree ML Computing Boolean algebra Software engineering
758	Microsoft Word - PLCGuide.doc Add to Reading List Source URL: download.arsoft-int.com Language: English - Date: 2009-06-25 09:45:19 Procedural programming languages Data types Primitive types Pascal ALGOL 68 Subroutine FALSE Boolean data type Visual Basic Software engineering Computer programming Computing
759	Journal of Artificial Intelligence Research606 Submitted 11/07; publishedSATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu Add to Reading List Source URL: www.jair.org Language: English - Date: 2008-07-01 13:34:37 NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Algorithm Computational complexity theory Solver Theoretical computer science Applied mathematics Mathematics
760	Artificial Intelligence–120 www.elsevier.com/locate/artint Compiling problem specifications into SAT ✩ Marco Cadoli a,∗ , Andrea Schaerf b a Dipartimento di Informatica e Sistemistica, Università di Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:15 Complexity classes NP-complete problems Mathematical optimization Logic in computer science Boolean satisfiability problem Electronic design automation NP-complete 2-satisfiability NP Theoretical computer science Computational complexity theory Applied mathematics

UPDATE