找回密碼
 To register

QQ登錄

只需一步,快速開(kāi)始

掃一掃,訪問(wèn)微社區(qū)

打印 上一主題 下一主題

Titlebook: Complexity and Approximation; In Memory of Ker-I K Ding-Zhu Du,Jie Wang Book 2020 Springer Nature Switzerland AG 2020 real functions.comple

[復(fù)制鏈接]
查看: 43332|回復(fù): 61
樓主
發(fā)表于 2025-3-21 16:57:47 | 只看該作者 |倒序?yàn)g覽 |閱讀模式
書(shū)目名稱(chēng)Complexity and Approximation
副標(biāo)題In Memory of Ker-I K
編輯Ding-Zhu Du,Jie Wang
視頻videohttp://file.papertrans.cn/232/231660/231660.mp4
概述This Festschrift is in honor of Ker-I Ko, who was one of the founding fathers of computational complexity over real numbers and analysis.Professor Ker-I Ko was one of the key players in the areas of C
叢書(shū)名稱(chēng)Lecture Notes in Computer Science
圖書(shū)封面Titlebook: Complexity and Approximation; In Memory of Ker-I K Ding-Zhu Du,Jie Wang Book 2020 Springer Nature Switzerland AG 2020 real functions.comple
描述.This Festschrift is in honor of Ker-I Ko, Professor in the Stony Brook University, USA. Ker-I Ko was one of the founding fathers of computational complexity over real numbers and analysis. He and Harvey Friedman devised a theoretical model for real number computations by extending the computation of Turing machines. He contributed signi?cantly to advancing the theory of structural complexity, especially on polynomial-time isomorphism, instance complexity, and relativization of polynomial-time hierarchy. Ker-I also made many contributions to approximation algorithm theory of combinatorial optimization problems. This volume contains 17 contributions in the area of complexity and approximation. Those articles are authored by researchers over the world, including North America, Europe and Asia. Most of them are co-authors, colleagues, friends, and students of Ker-I Ko..
出版日期Book 2020
關(guān)鍵詞real functions; complexity and approximation; combinatorial optimization; complexity theory of real fun
版次1
doihttps://doi.org/10.1007/978-3-030-41672-0
isbn_softcover978-3-030-41671-3
isbn_ebook978-3-030-41672-0Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer Nature Switzerland AG 2020
The information of publication is updating

書(shū)目名稱(chēng)Complexity and Approximation影響因子(影響力)




書(shū)目名稱(chēng)Complexity and Approximation影響因子(影響力)學(xué)科排名




書(shū)目名稱(chēng)Complexity and Approximation網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱(chēng)Complexity and Approximation網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱(chēng)Complexity and Approximation被引頻次




書(shū)目名稱(chēng)Complexity and Approximation被引頻次學(xué)科排名




書(shū)目名稱(chēng)Complexity and Approximation年度引用




書(shū)目名稱(chēng)Complexity and Approximation年度引用學(xué)科排名




書(shū)目名稱(chēng)Complexity and Approximation讀者反饋




書(shū)目名稱(chēng)Complexity and Approximation讀者反饋學(xué)科排名




單選投票, 共有 1 人參與投票
 

1票 100.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用戶組沒(méi)有投票權(quán)限
沙發(fā)
發(fā)表于 2025-3-21 21:41:04 | 只看該作者
板凳
發(fā)表于 2025-3-22 01:34:27 | 只看該作者
Roberto Giacobazzi,Isabella Mastroenid in .; we also show an upper bound of . even if there is no computational bound on a hitting set generator. These results provide additional evidence that the recent worst-case to average-case reductions within . shown by Hirahara (2018, FOCS) are inherently non-black-box. (We omit all detailed arguments and proofs, which can be found in [.].)
地板
發(fā)表于 2025-3-22 08:04:29 | 只看該作者
5#
發(fā)表于 2025-3-22 09:48:43 | 只看該作者
6#
發(fā)表于 2025-3-22 14:48:27 | 只看該作者
7#
發(fā)表于 2025-3-22 19:02:24 | 只看該作者
Computability of the Solutions to Navier-Stokes Equations via Effective Approximation,e nonlinear inhomogeneous incompressible Navier-Stokes initial value problem uniformly computable. Based on classical approaches, the proofs make use of many subtle and intricate estimates which are developed in the paper for establishing the computability results.
8#
發(fā)表于 2025-3-22 23:16:14 | 只看該作者
0302-9743 fessor Ker-I Ko was one of the key players in the areas of C.This Festschrift is in honor of Ker-I Ko, Professor in the Stony Brook University, USA. Ker-I Ko was one of the founding fathers of computational complexity over real numbers and analysis. He and Harvey Friedman devised a theoretical model
9#
發(fā)表于 2025-3-23 01:53:38 | 只看該作者
10#
發(fā)表于 2025-3-23 07:33:58 | 只看該作者
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛(ài)論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評(píng) 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國(guó)際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-7 23:13
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
镇宁| 扶风县| 武功县| 青铜峡市| 威海市| 万载县| 荔浦县| 天水市| 浦县| 时尚| 安图县| 织金县| 滁州市| 日土县| 南丰县| 祁阳县| 家居| 浙江省| 南昌县| 昂仁县| 遵义市| 通榆县| 留坝县| 盐亭县| 靖州| 海林市| 崇州市| 和平区| 长海县| 平武县| 凤凰县| 汉寿县| 资中县| 扬州市| 松溪县| 肥城市| 枞阳县| 西华县| 衡南县| 新田县| 扬中市|