The approximability of problems complete for P-Reference-Cited by-同舟云学术

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

The approximability of problems complete for P

Published:1989 Issue: Volume: Page:193-204
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Serna Maria,Spirakis Paul

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-51859-2_16.pdf

Reference11 articles.

1. "Complete Problems for Deterministic Polynomial Time" by N. Jones and W. Laaser, Theor. Computer Science 3 (1977), 105–117.

2. "Optimization, Approximation and Complexity classes", by C.H. Papadimitriou and M. Yannakakis, STOC 1988.

3. "Approximating P-Complete Problems", by R. Anderson and E. Mayr, TR Stanford Univ., 1986.

4. "Parallel Approximation Algorithms for one-Dimensional Bin Packing", by Warmuth, TR Univ. of California at Santa Cruz, 1986.

5. "Probabilistic log-space reductions and problems probabilistically hard for P", by L. Kirousis and P. Spirakis, SWAT 88.

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

1. Exact Pairs for Abstract Bounded Reducibilities;Mathematical Logic Quarterly;1999

2. On the Average Case Complexity of Some P-complete Problems;RAIRO - Theoretical Informatics and Applications;1999-01

3. The Linkage of a Graph;SIAM Journal on Computing;1996-06

4. Parallel approximation of optimization problems;Solving Combinatorial Optimization Problems in Parallel;1996

5. Tight RNC approximations to Max Flow;STACS 91

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP