找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Computing and Combinatorics; 17th Annual Internat Bin Fu,Ding-Zhu Du Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelberg 201

[复制链接]
查看: 33788|回复: 64
发表于 2025-3-21 19:12:38 | 显示全部楼层 |阅读模式
书目名称Computing and Combinatorics
副标题17th Annual Internat
编辑Bin Fu,Ding-Zhu Du
视频video
概述Up-to-date results.Fast-track conference proceedings.State-of-the-art research
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Computing and Combinatorics; 17th Annual Internat Bin Fu,Ding-Zhu Du Conference proceedings 2011 Springer-Verlag GmbH Berlin Heidelberg 201
描述This book constitutes the refereed proceedings of the 17th Annual International Conference on Computing and Combinatorics, held in Dallas, TX, USA, in August 2011. The 54 revised full papers presented were carefully reviewed and selected from 136 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization; parallel and distributed computing.
出版日期Conference proceedings 2011
关键词algorithmic geometry; algorithmic learning; combinatorial optimization; discrete mathematics; graph algo
版次1
doihttps://doi.org/10.1007/978-3-642-22685-4
isbn_softcover978-3-642-22684-7
isbn_ebook978-3-642-22685-4Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag GmbH Berlin Heidelberg 2011
The information of publication is updating

书目名称Computing and Combinatorics影响因子(影响力)




书目名称Computing and Combinatorics影响因子(影响力)学科排名




书目名称Computing and Combinatorics网络公开度




书目名称Computing and Combinatorics网络公开度学科排名




书目名称Computing and Combinatorics被引频次




书目名称Computing and Combinatorics被引频次学科排名




书目名称Computing and Combinatorics年度引用




书目名称Computing and Combinatorics年度引用学科排名




书目名称Computing and Combinatorics读者反馈




书目名称Computing and Combinatorics读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

1票 100.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 21:21:25 | 显示全部楼层
Viscosity Phenomena in a Magnetic Field, a heuristic to search for a minimum set of 0/1-flips such that the resulting matrix admits a directed perfect phylogeny. We then extend our approach by using edge weights to weight the columns of the 0/1/?-matrix..In our evaluation, we show that our method is extremely swift in practice, and orders
发表于 2025-3-22 02:07:14 | 显示全部楼层
发表于 2025-3-22 07:13:02 | 显示全部楼层
发表于 2025-3-22 10:27:02 | 显示全部楼层
发表于 2025-3-22 13:58:58 | 显示全部楼层
发表于 2025-3-22 20:17:47 | 显示全部楼层
Quantum Algorithm for the Boolean Hidden Shift Problem,exity of the algorithm is polynomial. Based on this we show an average case exponential separation between classical and quantum time complexity. A perhaps interesting aspect of this work is that, while the extremal case of the Boolean hidden shift problem over so-called bent functions can be reduce
发表于 2025-3-22 22:33:33 | 显示全部楼层
发表于 2025-3-23 03:56:42 | 显示全部楼层
发表于 2025-3-23 09:20:06 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-23 09:57
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表