P=NP for some structures over the binary words-Reference-Cited by-同舟云学术

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

P=NP for some structures over the binary words

Published:2005-08 Issue:4 Volume:21 Page:557-578
ISSN:0885-064X
Container-title:Journal of Complexity
language:en
Short-container-title:Journal of Complexity

Author:

Hemmerling Armin

Publisher

Elsevier BV

Subject

Applied Mathematics,Control and Optimization,Numerical Analysis,Statistics and Probability,Algebra and Number Theory,General Mathematics

Reference25 articles.

1. Relativizations of the P=?NP questions;Baker;SIAM J. Comput.,1975

2. Complexity and Real Computation;Blum,1998

3. On a theory of computation and complexity over the real numbers: NP-completeness, recursive functions and universal machines;Blum;Bull. AMS,1989

4. F. Didehvar, M. Ardeshir, Rapid elimination of quantifier, Logic Colloquium 2002, Progam Booklet, Münster 2002, p. 32.

5. F. Didehvar, M. Ardeshir, A model for rapid elimination of quantifiers for a special finite language, Technical Report, Tehran, 2002.

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

1. ON COMPUTATIONS OVER ORDERED RINGS;SIB ELECTRON MATH RE;2022

2. On Relativizations of the P =? NP Question for Several Structures;Electronic Notes in Theoretical Computer Science;2008-12

3. The polynomial hierarchy for some structures over the binary words;MLQ;2007-01

4. Structure with fast elimination of quantifiers;Journal of Symbolic Logic;2006-03

5. Fast Quantifier Elimination Means P = NP;Logical Approaches to Computational Barriers;2006

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP