NP-complete - PDFSEARCH.IO - Document Search Engine

NP-complete
Results: 1728

#	Item
421	Newton’s Method Steve Smale The expression is a mathematical description of Newton’s Method. Long before Newton, the concept already was used by the Greeks for finding the square root of a positive number. Since Newt Add to Reading List Source URL: www.gregkucera.com Language: English - Date: 2015-01-07 20:36:16 Applied mathematics Polynomial Computational complexity theory NP-complete Fundamental theorem of algebra Algorithm Carl Friedrich Gauss NP P Mathematics Theoretical computer science Complexity classes
422	Course: Satisfiability Modulo Theories (SMT): ideas and applications Send your assignment to: 1. Mark the following formulas as valid, satisfiable or unsatisfiable. a. p  q  p  q b. (p  Add to Reading List Source URL: leodemoura.github.io Language: English - Date: 2015-05-19 13:22:05 NP-complete problems Mathematical logic Electronic design automation Formal methods Logic in computer science Boolean satisfiability problem Resolution Satisfiability Modulo Theories If and only if Theoretical computer science Mathematics Logic
423	TRY TH S Listening and Logic LEVEL: Low Intermediate and above MATERIALS: Copies of the logic grids and Add to Reading List Source URL: americanenglish.state.gov Language: English - Date: 2015-03-13 08:01:39 Breakfast Fried egg Personal life NP-complete problems Human behavior Crossword Meals Breakfast foods Logic puzzles
424	Tensors and Optimization Ravi Kannan September 16, 2013 Ravi Kannan Add to Reading List Source URL: simons.berkeley.edu Language: English - Date: 2014-03-13 13:08:11 Mathematical optimization Applied mathematics Mathematics Logic in computer science Constraint programming NP-complete problems Theoretical computer science Operations research Tensor
425	MUNCH - Automated Reasoner for Sets and Multisets Ruzica Piskac and Viktor Kuncak Swiss Federal Institute of Technology Lausanne (EPFL) Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2010-05-11 07:07:53 Logic in computer science Metalogic Model theory Multiset NP-complete problems Presburger arithmetic Satisfiability Modulo Theories Cardinality Generalized arithmetic progression Mathematics Mathematical logic Theoretical computer science
426	Complete Functional Synthesis Viktor Kuncak Mika¨el Mayer Ruzica Piskac Add to Reading List Source URL: lara.epfl.ch Language: English - Date: 2010-04-01 07:52:40 Model theory Logic in computer science Predicate logic Semantics NP-complete problems Satisfiability Modulo Theories Function First-order logic Quantifier elimination Mathematics Mathematical logic Logic
427	Integrality Gaps for Sherali–Adams Relaxations Moses Charikar∗ Princeton University Konstantin Makarychev IBM T.J. Watson Research Center Add to Reading List Source URL: konstantin.makarychev.net Language: English - Date: 2014-06-08 22:16:40 NP-complete problems Connectivity Vertex cover Linear programming relaxation Tree Graph SL Regular graph Graph theory Theoretical computer science Mathematics
428	Algorithms Lecture 4: Efficient Exponential-Time Algorithms [Fa’14] Wouldn’t the sentence “I want to put a hyphen between the words Fish and And and And and Chips in my Fish-And-Chips sign.” have been clearer if Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:02:22 NP-complete problems Analysis of algorithms Graph coloring Graph theory Time complexity Boolean satisfiability problem Randomized algorithm MAXEkSAT One-in-three 3SAT Theoretical computer science Computational complexity theory Mathematics
429	PDF Document Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-17 12:02:13 NP-complete problems Graph coloring Tree Clique Maximal independent set Graph Connectivity Connected component Independent set Graph theory Mathematics Theoretical computer science
430	Distribution of forcing and anti-forcing numbers of random perfect matchings on hexagonal chains and crowns Hsien-Kuei Hwanga , Hongchuan Leib, Yeong-Nan Yehc , Heping Zhangd a Institute Add to Reading List Source URL: 140.109.74.92 Language: English - Date: 2015-01-21 18:54:09 NP-complete problems Combinatorial optimization Matching Graph coloring Forcing Hexagon Recurrence relation Dominating set Mathematics Theoretical computer science Graph theory

UPDATE