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

Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP

  • Published:1998-02 Issue:3 Volume:65 Page:151-156
  • ISSN:0020-0190
  • Container-title:Information Processing Letters
  • language:en
  • Short-container-title:Information Processing Letters

Author:

Hemaspaandra Edith,Rothe Jörg

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference13 articles.

1. It is hard to know when greedy is good for finding independent sets;Bodlaender;Inform. Process. Lett.,1997

2. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979

3. Greed is good: Approximating independent sets in sparse and bounded-degree graphs;Halldorsson,1994

4. Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP;Hemaspaandra,1997

5. The polynomial time hierarchy collapses if the boolean hierarchy collapses;Kadin;SIAM J. Comput.,1988

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3