P-complete - PDFSEARCH.IO - Document Search Engine

P-complete
Results: 1431

#	Item
351	Alloy: A Higher-Order Relational Constraint Solver Aleksandar Milicevic Joseph P. Near Eunsuk Kang Add to Reading List Source URL: people.csail.mit.edu Language: English* - Date: 2014-09-09 16:16:23 Electronic design automation Formal methods Logic in computer science NP-complete problems Constraint programming Satisfiability Modulo Theories First-order logic Alloy Tree Theoretical computer science Mathematical logic Applied mathematics
352	ANNALS OF PURE AND APPLIED LOGIC Annals of Pure and Applied Logic276 Fixed-parameter tractability and completeness IV: Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:20:30 Complexity classes NP-complete problems Structural complexity theory Mathematical optimization Parameterized complexity Dominating set P versus NP problem NP-complete Combinatory logic Theoretical computer science Computational complexity theory Applied mathematics
353	#244/3, 6th Link, Ringway Estates, Accra. P. O. BOX 17753, Accra – Ghana. TEL: (, 246322, 246644, FAX: (FIRE INSURANCE PROPOSAL (PLEASE COMPLETE THIS IN BLOCK LETTERS) #244/3, 6t Add to Reading List Source URL: www.phoenixinsurancegh.com Language: English - Date: 2015-01-12 17:53:52 Institutional investors Insurance Property insurance Accra Geography of Africa Economics Types of insurance Financial institutions Financial economics
354	Life Without Death is P-complete Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-10-10 16:17:58 Tools Cellular automaton Life without Death Ladder logic Ladder paradox Technology Ladder Stairways
355	Constraints DOIs10601The Complexity of Reasoning with Global Constraints Christian Bessiere · Emmanuel Hebrard · Brahim Hnich · Toby Walsh Add to Reading List Source URL: homepages.laas.fr Language: English - Date: 2010-11-22 06:22:29 Applied mathematics Mathematical optimization Local consistency Constraint satisfaction NP-complete Computational complexity theory P versus NP problem NP Complexity of constraint satisfaction Constraint programming Theoretical computer science Complexity classes
356	Complete Controls O p e r a t o r s G u i d e v0.1 Table of Contents Operations Overview System Startup Add to Reading List Source URL: www.glendinningprods.com Language: English - Date: 2015-04-06 16:08:54 Transport Technology Automatic transmission Mechanical engineering Throttle response Throttle
357	CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Memory Requirements for Local Geometric Routing and Traversal in Digraphs M. Fraser Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-29 00:00:20 Planar graphs Graph Unit disk graph Planar straight-line graph P Geographic routing Graph theory Theoretical computer science NP-complete problems
358	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 On the parameterized complexity of a generalized Rush Hour puzzle ∗ H. Fernau† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:31 Puzzles Rush Hour Parameterized complexity PSPACE-complete Polynomial P Games Complexity classes Mechanical puzzles
359	Automatic Design of Decision-Tree Induction Algorithms Rodrigo C. Barros Márcio P. Basgalupp Add to Reading List Source URL: www.genetic-programming.org Language: English - Date: 2013-07-05 18:31:06 Mathematics Learning Algorithm Mathematical logic Theoretical computer science Medical algorithm Random forest Data mining Book:Machine Learning - The Complete Guide Artificial intelligence Ensemble learning Decision trees
360	Complete list of publications Pierre Ganty December 15, 2012 Conference Publications [1] Pierre Ganty, Radu Iosif, and Filip Koneˇcn´ y. Underapproximation of procedure summaries for integer programs. In TACAS ’13: P Add to Reading List Source URL: software.imdea.org Language: English - Date: 2012-12-15 15:15:15 Models of computation Model checking Petri net Lecture Notes in Computer Science ALGOL 68 Computer Aided Verification Formal methods Software engineering Computing Programming language theory

UPDATE