找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Automata, Languages and Programming; 34th International C Lars Arge,Christian Cachin,Andrzej Tarlecki Conference proceedings 2007 Springer-

[复制链接]
楼主: Spouse
发表于 2025-3-25 04:54:38 | 显示全部楼层
发表于 2025-3-25 11:06:20 | 显示全部楼层
发表于 2025-3-25 12:02:10 | 显示全部楼层
A “proof-reading” of Some Issues in Cryptography and what theoretic results on security mean for practical applications. We argue that several such issues are often overlooked or misunderstood, and that it may be very productive if both theoreticians and practitioners think more consciously about these issues and act accordingly.
发表于 2025-3-25 17:25:35 | 显示全部楼层
发表于 2025-3-25 23:16:22 | 显示全部楼层
Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minimaablishing probabilistic single exponential time algorithms for them. The result generalize and extend previous results of Ajtai, Kumar and Sivakumar. The results on . and . are new for all norms. The results on . and . generalize previous results of Ajtai et al. for the ℓ. norm to arbitrary ℓ. norms.
发表于 2025-3-26 00:27:57 | 显示全部楼层
Labeling Schemes for Vertex Connectivityt . vertex disjoint paths connecting . and .. The paper establishes an upper bound of ..log. on the number of bits used in a label. The best previous upper bound for the label size of such labeling scheme is 2.log..
发表于 2025-3-26 07:19:00 | 显示全部楼层
A Lower Bound on Entanglement-Assisted Quantum Communication ComplexityAs an application of this bound, we give a very simple proof of the statement that almost all Boolean functions on . + . bits have communication complexity linear in ., even in the presence of unlimited entanglement.
发表于 2025-3-26 10:07:18 | 显示全部楼层
Commitment Under Uncertainty: Two-Stage Stochastic Matching Problemse prove lower bounds, and analyze efficient strategies for both cases. These problems model real-life stochastic integral planning problems such as commodity trading, reservation systems and scheduling under uncertainty.
发表于 2025-3-26 13:55:26 | 显示全部楼层
Competitive Algorithms for Due Date Scheduling This result extends to the case that each job has a weight and the objective is weighted quoted lead time..We then introduce the following general setting: there is a non- increasing profit function ..(.) associated with each job ... If the customer for job .. is quoted a due date of .., then the p
发表于 2025-3-26 18:11:18 | 显示全部楼层
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexityit function which has .(loglog.) randomized complexity for private coins but only constant complexity for public coins..It follows from our existential result that any function that is complete for the class of functions with polylogarithmic nondeterministic .-party communication complexity does not
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-19 02:13
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表