找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: SOFSEM 2006: Theory and Practice of Computer Science; 32nd Conference on C Jiří Wiedermann,Gerard Tel,Július Štuller Conference proceedings

[复制链接]
查看: 10322|回复: 62
发表于 2025-3-21 17:24:43 | 显示全部楼层 |阅读模式
书目名称SOFSEM 2006: Theory and Practice of Computer Science
副标题32nd Conference on C
编辑Jiří Wiedermann,Gerard Tel,Július Štuller
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: SOFSEM 2006: Theory and Practice of Computer Science; 32nd Conference on C Jiří Wiedermann,Gerard Tel,Július Štuller Conference proceedings
出版日期Conference proceedings 2006
关键词DOM; Monitor; Signatur; algorithms; automata; complexity; computer science; database management; database sy
版次1
doihttps://doi.org/10.1007/11611257
isbn_softcover978-3-540-31198-0
isbn_ebook978-3-540-32217-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2006
The information of publication is updating

书目名称SOFSEM 2006: Theory and Practice of Computer Science影响因子(影响力)




书目名称SOFSEM 2006: Theory and Practice of Computer Science影响因子(影响力)学科排名




书目名称SOFSEM 2006: Theory and Practice of Computer Science网络公开度




书目名称SOFSEM 2006: Theory and Practice of Computer Science网络公开度学科排名




书目名称SOFSEM 2006: Theory and Practice of Computer Science被引频次




书目名称SOFSEM 2006: Theory and Practice of Computer Science被引频次学科排名




书目名称SOFSEM 2006: Theory and Practice of Computer Science年度引用




书目名称SOFSEM 2006: Theory and Practice of Computer Science年度引用学科排名




书目名称SOFSEM 2006: Theory and Practice of Computer Science读者反馈




书目名称SOFSEM 2006: Theory and Practice of Computer Science读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

1票 100.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 20:37:44 | 显示全部楼层
Non-intersecting Complexity degree and non-deterministic complexity on one hand and still is a lower bound for deterministic complexity. Some inequalities and counterexamples are presented and usage in symmetrisation polynomials is considered.
发表于 2025-3-22 04:17:18 | 显示全部楼层
Searching Paths of Constant Bandwidth such a path of length . in a given graph is NP-complete and fixed-parameter tractable (FPT) in the parameter ., like this is known for the special case . = 1, the LONGEST PATH problem. We state the FPT algorithm in terms of a guess and check protocol which uses witnesses of size polynomial in the parameter.
发表于 2025-3-22 07:32:12 | 显示全部楼层
发表于 2025-3-22 12:18:26 | 显示全部楼层
发表于 2025-3-22 14:49:22 | 显示全部楼层
978-3-540-31198-0Springer-Verlag Berlin Heidelberg 2006
发表于 2025-3-22 17:56:00 | 显示全部楼层
SOFSEM 2006: Theory and Practice of Computer Science978-3-540-32217-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-22 23:59:54 | 显示全部楼层
0302-9743 Overview: 978-3-540-31198-0978-3-540-32217-7Series ISSN 0302-9743 Series E-ISSN 1611-3349
发表于 2025-3-23 01:56:21 | 显示全部楼层
A Formal Comparison of Visual Web Wrapper GeneratorsWe study the core fragment of the Elog wrapping language used in the Lixto system (a visual wrapper generator) and formally compare Elog to other wrapping languages proposed in the literature.
发表于 2025-3-23 05:58:13 | 显示全部楼层
n, BKK-3, SPLITTERWERK, Preston Scott Cohen, Manabu Chiba, Artec, Franziska Ullmann, Otto Steidle, Auböck & Karasz, Edouard Francois, Johannes Kaufmann, Wolfgang Pöschl, Rainer Köberl, Boris Podrecca, Nasrine Seraji, Zamp Kelp, Geiswinkler & Geiswinkler, Helmut Richter, Thomas Herzog, Riegler Riewe,
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-28 03:52
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表