首页 | 本学科首页 官方微博 | 高级检索

 按 中文标题 英文标题 中文关键词 英文关键词 中文摘要 英文摘要 作者中文名 作者英文名 单位中文名 单位英文名 基金中文名 基金英文名 杂志中文名 杂志英文名 栏目英文名 栏目英文名 DOI 责任编辑 分类号 杂志ISSN号 检索 检索词:

 收费全文 3篇 国内免费 2篇 完全免费 4篇
 自动化技术 9篇
 2009年 1篇 2008年 2篇 2006年 3篇 2005年 2篇 2002年 1篇

1
1.

2.
We investigate the complexity of deciding whether for minimal unsatisfiable formulas F and H there exists a variable renaming, a literal renaming or a homomorphism such that (F)=H. A variable renaming is a permutation of variables. A literal renaming is a permutation of variables which additionally replaces some of the variables by its complements. A homomorphism can be considered as a literal renaming which can map different literals to one literal.  相似文献
3.
MAX(1)和MARG(1)中公式改名的复杂性   总被引：1，自引：0，他引：1

4.
k-LSAT(k≥3)是NP-完全的(英文)   总被引：1，自引：0，他引：1

5.
k-LSAT (k≥3)是NP-完全的   总被引：1，自引：0，他引：1       下载免费PDF全文

6.
We investigate the complexity of deciding whether for minimal unsatisfiable formulas F and H there exists a variable renaming, a literal renaming or a homomorphism such that (F) = H. A variable renaming is a permutation of variables. A literal renaming is a permutation of variables which additionally replaces some of the variables by its complements. A homomorphism can be considered as a literal renaming which can map different literals to one literal.  相似文献
7.
We say a propositional formula F in conjunctive normal form is represented by a formula H and a homomorphism φ, if φ(H)=F. A homomorphism is a mapping consisting of a renaming and an identification of literals. The deficiency of a formula is the difference between the number of clauses and the number of variables. We show that for fixed k?1 and t?1 each minimal unsatisfiable formula with deficiency k can be represented by a formula H with deficiency t and a homomorphism and such a representation can be computed in polynomial time.  相似文献
8.

9.

1