Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,023,872 papers from all fields of science
Search
Sign In
Create Free Account
(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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Clause (logic)
Computational complexity theory
Conjunctive normal form
MAX-3SAT
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
RL-Based Radio Resource Slicing Strategy for Software-Defined Satellite Networks
Z. Deng
,
Qin Du
,
Ning Li
,
Yunpeng Zhang
International Conference on Speech Technology and…
2019
Corpus ID: 209852886
As an attractive infrastructure, satellite networks have obvious limitations such as high complexity and lack of flexibility. The…
Expand
2017
2017
La espiritualidad y los espacios sagrados en las culturas aborígenes del litoral ecuatoriano
Parsival E. Castro-Pita
,
Ivetheyamel Morales-Vergara
,
Ivonne A. Rendon-Jaluff
2017
Corpus ID: 189421875
La actual division politica de los paises, no coincide con la ocupacion geografica de las culturas aborigenes, que especialmente…
Expand
2011
2011
非饱和带溶质运移模拟软件(WHI UnSat Suite)简介
丁素玲
2011
Corpus ID: 195635046
非饱和带是研究地下水必须关注的领域,污染物在包气带中的迁移转化过程直接影响着其对自然界整体环境的表观作用,对这一过程的数值模拟研究在污染物系统分析中起到了不可替代的作用。国外应用较多的一个非饱和带水流和溶质运移模拟软件是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
Hoifung Poon
,
Pedro M. Domingos
,
M. Sumner
AAAI Conference on Artificial Intelligence
2008
Corpus ID: 9586355
Many real-world problems are characterized by complex relational structure, which can be succinctly represented in first-order…
Expand
2008
2008
Politically credible social insurance
Christopher Sleet
,
Sevin Yeltekin
2008
Corpus ID: 16897928
2006
2006
Cooperative BoundedModelChecking UsingSTEandHybridThree-Valued SAT Solving*
Shujun Deng
,
Jinian Bian
2006
Corpus ID: 62456964
Thispaperpresents a cooperative bounded model checking (BMC)method forRTLdesigns. Themethod firstly extends theBoolean…
Expand
2006
2006
Finding Models for Blocked 3-SAT Problems in Linear Time by Systematical Refinement of a Sub-model
Gábor Kusper
Deutsche Jahrestagung für Künstliche Intelligenz
2006
Corpus ID: 9698151
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.
Ping-Cheng Yeh
2005
Corpus ID: 195964312
To my parents, my wife Joanna and our baby Justin. ii ACKNOWLEDGEMENTS I would like to express my deepest gratitude to my advisor…
Expand
2002
2002
Using Failed Local Search for SAT as an Oracle for Tackling Harder A.I. Problems More Efficiently
É. Grégoire
,
Bertrand Mazure
,
L. Sais
Artificial Intelligence: Methodology, Systems…
2002
Corpus ID: 35104488
Local search is often a suitable paradigm for solving hard decision problems and approximating computationally difficult ones in…
Expand
2000
2000
Perancangan produksi dan pengendalian persediaan di UD. Kompas
Yadi Budiono
2000
Corpus ID: 187386611
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
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE