Prophylaxis 发表于 2025-3-25 06:34:46

http://reply.papertrans.cn/16/1531/153019/153019_21.png

继承人 发表于 2025-3-25 09:45:57

http://reply.papertrans.cn/16/1531/153019/153019_22.png

Intend 发表于 2025-3-25 15:28:18

http://reply.papertrans.cn/16/1531/153019/153019_23.png

Fecundity 发表于 2025-3-25 17:57:25

Algorithmics for Hard Problems978-3-662-05269-3Series ISSN 1862-4499 Series E-ISSN 1862-4502

intoxicate 发表于 2025-3-25 23:56:43

http://reply.papertrans.cn/16/1531/153019/153019_25.png

橡子 发表于 2025-3-26 00:39:16

978-3-642-07909-2Springer-Verlag Berlin Heidelberg 2004

CAPE 发表于 2025-3-26 04:30:39

http://reply.papertrans.cn/16/1531/153019/153019_27.png

渗入 发表于 2025-3-26 10:07:42

Texts in Theoretical Computer Science. An EATCS Serieshttp://image.papertrans.cn/a/image/153019.jpg

Merited 发表于 2025-3-26 16:17:58

https://doi.org/10.1007/978-3-0348-6443-5-time algorithms. are known. It focuses on a . presentation of the fundamental concepts and algorithm design techniques such as pseudopolynomial-time algorithms, parameterized complexity, branch-and-bound, local search, lowering the worst case complexity of exponential algorithms, dual approximation

隼鹰 发表于 2025-3-26 18:08:12

http://reply.papertrans.cn/16/1531/153019/153019_30.png
页: 1 2 [3] 4
查看完整版本: Titlebook: Algorithmics for Hard Problems; Introduction to Comb Juraj Hromkovič Textbook 2004Latest edition Springer-Verlag Berlin Heidelberg 2004 Tex