迅速 发表于 2025-3-21 17:08:56

书目名称Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems影响因子(影响力)<br>        http://figure.impactfactor.cn/if/?ISSN=BK0302965<br><br>        <br><br>书目名称Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems影响因子(影响力)学科排名<br>        http://figure.impactfactor.cn/ifr/?ISSN=BK0302965<br><br>        <br><br>书目名称Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems网络公开度<br>        http://figure.impactfactor.cn/at/?ISSN=BK0302965<br><br>        <br><br>书目名称Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems网络公开度学科排名<br>        http://figure.impactfactor.cn/atr/?ISSN=BK0302965<br><br>        <br><br>书目名称Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems被引频次<br>        http://figure.impactfactor.cn/tc/?ISSN=BK0302965<br><br>        <br><br>书目名称Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems被引频次学科排名<br>        http://figure.impactfactor.cn/tcr/?ISSN=BK0302965<br><br>        <br><br>书目名称Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems年度引用<br>        http://figure.impactfactor.cn/ii/?ISSN=BK0302965<br><br>        <br><br>书目名称Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems年度引用学科排名<br>        http://figure.impactfactor.cn/iir/?ISSN=BK0302965<br><br>        <br><br>书目名称Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems读者反馈<br>        http://figure.impactfactor.cn/5y/?ISSN=BK0302965<br><br>        <br><br>书目名称Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems读者反馈学科排名<br>        http://figure.impactfactor.cn/5yr/?ISSN=BK0302965<br><br>        <br><br>

垫子 发表于 2025-3-21 22:53:43

http://reply.papertrans.cn/31/3030/302965/302965_2.png

perimenopause 发表于 2025-3-22 01:55:11

Book 1995mproved the presentation and included the progress achieved since the thesis was approved by the University of California at Berkeley..This work is a fascinating piece of theoretical computer science research building on deep results from different areas. It provides new theoretical insights and adv

PALL 发表于 2025-3-22 07:20:27

Book 1995ances applicable techniques in such different areas as computational complexity, efficient (randomized) checking of proofs, programs and polynomials, approximation algorithms, NP-complete optimization, and error-detection and error-correction algorithms in coding theory.

发酵 发表于 2025-3-22 11:00:26

http://reply.papertrans.cn/31/3030/302965/302965_5.png

LEVY 发表于 2025-3-22 14:35:54

http://reply.papertrans.cn/31/3030/302965/302965_6.png

LEVY 发表于 2025-3-22 17:43:24

Lecture Notes in Computer Sciencehttp://image.papertrans.cn/e/image/302965.jpg

哥哥喷涌而出 发表于 2025-3-22 23:56:17

http://reply.papertrans.cn/31/3030/302965/302965_8.png

Aprope 发表于 2025-3-23 03:30:30

http://reply.papertrans.cn/31/3030/302965/302965_9.png

hemophilia 发表于 2025-3-23 08:57:01

http://reply.papertrans.cn/31/3030/302965/302965_10.png
页: [1] 2 3 4
查看完整版本: Titlebook: Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems; Madhu Sudan Book 1995 Springer-Verlag Berlin Heid