FINDING TYPE SETS IS NP-HARD-Reference-Cited by-同舟云学术

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

FINDING TYPE SETS IS NP-HARD

Published:1991-12 Issue:04 Volume:01 Page:437-444
ISSN:0218-1967
Container-title:International Journal of Algebra and Computation
language:en
Short-container-title:Int. J. Algebra Comput.

Author:

HOBBY DAVID¹

Affiliation:

1. Department of Mathematics, SUNY at New Paltz, New Paltz, NY 12561, USA

Abstract

It is shown that determining the type set of the variety generated by a finite algebra is a P-Space-hard problem. This is done by interpreting into it the P-Space-complete problem of determining if a given function is a composition of a set of unary functions on a set. Specifically, the given function is a composition of the others just when the type 3 is not in the type set of the variety generated by the algebra that is constructed. A lemma that restricts the types that are possible in the variety generated by a given algebra is also given.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218196791000304

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

1. On the complexity of the Leibniz hierarchy;Annals of Pure and Applied Logic;2019-07

2. ON THE COMPLEXITY OF SOME MALTSEV CONDITIONS;International Journal of Algebra and Computation;2009-02

3. THE TYPE SET OF A VARIETY IS NOT COMPUTABLE;International Journal of Algebra and Computation;2001-02

4. Three Lectures on the RS Problem;Algebraic Model Theory;1997

5. Computers and universal algebra: some directions;Algebra Universalis;1995-03

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP