Complexity of Nilpotent Unification and Matching Problems-Reference-Cited by-同舟云学术

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

Complexity of Nilpotent Unification and Matching Problems

Published:2000-10 Issue:1-2 Volume:162 Page:3-23
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Guo Qing,Narendran Paliath,Wolfram D.A.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference26 articles.

1. Set constraints: results, applications and future directions;Aiken,1994

2. The complexity of set constraints;Aiken,1993

3. Unification in commutative theories, Hilbert's Basis Theorem, and Gröbner bases;Baader;J. Assoc. Comput. Mach.,1993

4. Unification in the union of disjoint equational theories: combining decision procedures;Baader,1992

5. Unification theory;Baader,1994

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

1. Symbolic Methods in Computational Cryptography Proofs;2019 IEEE 32nd Computer Security Foundations Symposium (CSF);2019-06

2. Asymmetric Unification and Disunification;Lecture Notes in Computer Science;2019

3. Unification Modulo Chaining;Language and Automata Theory and Applications;2012

4. Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures;Theoretical Computer Science;2010-03

5. Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or;Automata, Languages and Programming;2006

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP