The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The class of problems that are linearly equivalent to Satisfiability or a uniform method for proving NP-completeness

Published:1995-07 Issue:1-2 Volume:145 Page:111-145
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Creignou Nadia

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference26 articles.

1. On the computational complexity of finding a kernel;Chvátal,1973

2. A uniform method for proving lower bounds on the computational complexity of logical theories;Compton;Ann. Pure Appl. Logic,1990

3. The complexity of theorem-proving procedures;Cook,1971

4. Exact complexity of problems of incompletely specified automata;Creignou;Tech. Report Univ. de Caen, France, Cahiers du LIUC 92-9,1992

5. Ann. Math. Artificial Intelligence;Creignou,1995

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. (k,H)-kernels in nearly tournaments;Discussiones Mathematicae Graph Theory;2022

2. A Multivariate Approach for Checking Resiliency in Access Control;Algorithmic Aspects in Information and Management;2016

3. An alternative approach for proving the NP-hardness of optimization problems;European Journal of Operational Research;2016-01

4. Propositional discourse logic;Synthese;2013-05-30

5. Argumentation frameworks as constraint satisfaction problems;Annals of Mathematics and Artificial Intelligence;2013-03-22

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP