Skip to search formSkip to main contentSkip to account menu

Cook–Levin theorem

Known as: Cook-Levin theorem, Cock Levin, Cook levin theorem 
In computational complexity theory, the Cook–Levin theorem, also known as Cook's theorem, states that the Boolean satisfiability problem is NP… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
This paper demonstrates that the Cook-Levin Theor em is false, so the NPCompleteness, since a faulty hidden assumption is t… 
2014
2014
A study was carried out to evaluate the secondary sexual characteristics of four strains of cocks, comprising of two (2) exotics… 
2010
2010
Monte Carlo simulations are used to compute the centrality dependence of the participant eccentricities ({var_epsilon}{sub n}) in… 
2009
2009
Nine hundred Wenchang chicken(0 weeks old) were randomly divided into 3 groups:low energy(Group Ⅰ),control(GroupⅡ)and high energy… 
2009
2009
We define a hierarchy of complexity classes that lie between P and RP, yielding a new way of quantifying partial progress towards… 
2004
2004
As is the case with many theorems in complexity theory, typical proofs of the celebrated Cook-Levin theorem showing the NP… 
2004
2004
Adaptation to unusual soil conditions is a common phenomenon in plants, and closely related taxa are frequently distinguished by… 
2000
2000
Part One: The Role of Culture Ann Davis, The Nickle Arts Museum, University of Calgary: Much Ado About Something: A Brief Study… 
1978
1978
RésuméLes auteurs rapportent leur expérience de la biopsie pulmonaire transbronchique sous fibroscopie selon la technique décrite…