FAQ

(SAT, ε-UNSAT)

Known as: (SAT, e-UNSAT) 
In computational complexity theory, (SAT, ε-UNSAT) is a language that is used in the proof of the PCP theorem, which relates the language NP to… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

2005-2017
01220052017

Related topics

Related topics

7 relations
Clause (logic)Computational complexity theoryConjunctive normal formMAX-3SAT
(More)

Related mentions per year

Related mentions per year

1942-2018
19401960198020002020
(SAT, ε-UNSAT)
Computational complexity theory
NP (complexity)
Conjunctive normal form
PCP theorem
Probabilistically checkable proof

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Poetic Image and Tradition in Western European Modernism
  • José Manuel Losada Goya
  • 2017
José Manuel Losada's article, "Poetic Image and Tradition in Western European Modernism: Pound, Lorca, Claudel," investigates… (More)
Is this relevant?
2011
2011
How to Apply SAT-Solving for the Equivalence Test of Monotone Normal Forms
The equivalence problem for monotone formulae in normal form Monet is in coNP, is probably not coNP-complete [10], and is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Neural circuits: Whose map is it anyway?
  • Nature
  • 2009
Even as ‘connectomics’ makes its way into the mainstream scientific vocabulary, there is already debate over what — if anything… (More)
Is this relevant?
2006
2006
Finding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub-model
We report a polynomial time SAT problem instance, the Blocked SAT problem. A blocked clause set, an instance of the Blocked SAT… (More)
Is this relevant?
2005
2005
Performance of Wireless Networks with Directional Antennas
To my parents, my wife Joanna and our baby Justin. ii ACKNOWLEDGEMENTS I would like to express my deepest gratitude to my advisor… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
Is this relevant?
2005
2005
Automatic Outer Volume Suppression ( OVS ) Slice Placement for Proton-Echo-Planar-Spectroscopic-Imaging ( PEPSI )
T. Li, M. Martinez-Ramon, G. Heileman, S. Posse MIND Institute, Albuquerque, NM, United States, University of New Mexico… (More)
  • figure 3
Is this relevant?