Titlebook: Mathematical Foundations of Computer Science 2007; 32nd International S Luděk Kučera,Antonín Kučera Conference proceedings 2007 Springer-Ve

显示全部楼层 · 发表于 2025-3-21 16:37:52

书目名称Mathematical Foundations of Computer Science 2007影响因子(影响力)

书目名称Mathematical Foundations of Computer Science 2007影响因子(影响力)学科排名

书目名称Mathematical Foundations of Computer Science 2007网络公开度

书目名称Mathematical Foundations of Computer Science 2007网络公开度学科排名

书目名称Mathematical Foundations of Computer Science 2007被引频次

书目名称Mathematical Foundations of Computer Science 2007被引频次学科排名

书目名称Mathematical Foundations of Computer Science 2007年度引用

书目名称Mathematical Foundations of Computer Science 2007年度引用学科排名

书目名称Mathematical Foundations of Computer Science 2007读者反馈

书目名称Mathematical Foundations of Computer Science 2007读者反馈学科排名

显示全部楼层 · 发表于 2025-3-21 20:58:29

显示全部楼层 · 发表于 2025-3-22 03:25:36

显示全部楼层 · 发表于 2025-3-22 04:55:27

显示全部楼层 · 发表于 2025-3-22 08:53:27

显示全部楼层 · 发表于 2025-3-22 15:24:17

Expander Properties and the Cover Time of Random Intersection Graphs (a) random intersection graphs are expanders, (b) random walks on such graphs are “rapidly mixing” (in particular they mix in logarithmic time) and (c) the cover time of random walks on such graphs is optimal (i.e. it is .(. log.)). All results are proved for . very close to the connectivity thresh

显示全部楼层 · 发表于 2025-3-22 17:49:11

显示全部楼层 · 发表于 2025-3-22 23:01:49

Rewriting Conjunctive Queries Determined by Viewstructing rewritings is a widely studied technique to derive those answers. In this paper we consider the problem of existence of rewritings in the case where the answers to the views uniquely determine the answers to the query. Specifically, we say that a view set .. a query . if for any two databas

显示全部楼层 · 发表于 2025-3-23 05:13:49

Approximation Algorithms for the Maximum Internal Spanning Tree Problemw, this problem is equivalent to the . problem, and is NP-hard as being a generalization of the . problem. Although there is no constant factor approximation for the . problem [1], . can be approximated within a factor of 2 [2]..In this paper we improve this factor by giving a .-approximation algori

显示全部楼层 · 发表于 2025-3-23 08:12:02

New Approximability Results for 2-Dimensional Packing Problemsmation schemes for this problem without and with 90. rotations. The additive constant in the approximation ratios of both algorithms is 1, improving on the additive term in the approximation ratios of the algorithm by Kenyon and Rémila (for the problem without rotations) and Jansen and van Stee (for

		自动登录	找回密码
密码			To register

关于派博传思			派博传思旗下网站			友情链接
派博传思介绍	公司地理位置	论文服务流程	影响因子官网	吾爱论文网	大讲堂	北京大学	Oxford Uni.	Harvard Uni.
发展历史沿革	期刊点评	投稿经验总结	SCIENCEGARD	IMPACTFACTOR	派博系数	清华大学	Yale Uni.	Stanford Uni.
\|Archiver\|手机版\|小黑屋\| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2026-6-25 18:06
Copyright © 2001-2015 派博传思京公网安备110108008328 版权所有 All rights reserved

Titlebook: Mathematical Foundations of Computer Science 2007; 32nd International S Luděk Kučera,Antonín Kučera Conference proceedings 2007 Springer-Ve

浏览过的版块