Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

(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… Expand
Wikipedia

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
La espiritualidad y los espacios sagrados en las culturas aborígenes del litoral ecuatoriano
La actual division politica de los paises, no coincide con la ocupacion geografica de las culturas aborigenes, que especialmente… Expand
2012
2012
Un modèle booléen pour l'énumération des siphons et des pièges minimaux dans les réseaux de Petri
Petri-nets are a simple formalism for modeling concurrent computation. Recently, they have emerged as a powerful tool for the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2011
2011
非饱和带溶质运移模拟软件（WHI UnSat Suite）简介
非饱和带是研究地下水必须关注的领域,污染物在包气带中的迁移转化过程直接影响着其对自然界整体环境的表观作用,对这一过程的数值模拟研究在污染物系统分析中起到了不可替代的作用。国外应用较多的一个非饱和带水流和溶质运移模拟软件是WHI UnSat Suite… Expand
Highly Cited
2008
Highly Cited
2008
A General Method for Reducing the Complexity of Relational Inference and its Application to MCMC
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in first-order… Expand
  • figure 1
  • figure 2
  • table 1
2008
2008
Politically credible social insurance
This paper considers the political credibility of allocations in settings with dynamic private information. It embeds a benchmark… Expand
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… Expand
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… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 2.4
  • figure 2.5
2002
2002
Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently
Local search is often a suitable paradigm for solving hard decision problems and approximating computationally difficult ones in… Expand
2002
2002
Marketing nas ondas da rádio : o composto mercadológico para a rede Itapema SAT
2000
2000
Perancangan produksi dan pengendalian persediaan di UD. Kompas
U.D. Kompas adalah sebuah perusahaan yang bergeruk dalam bidang industri makanan. Perusahaan melihat sat ini merupakan saat yang… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE