找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Mathematical Foundations of Computer Science 2014; 39th International S Erzsébet Csuhaj-Varjú,Martin Dietzfelbinger,Zoltán Conference proce

[复制链接]
查看: 32667|回复: 59
发表于 2025-3-21 19:08:46 | 显示全部楼层 |阅读模式
书目名称Mathematical Foundations of Computer Science 2014
副标题39th International S
编辑Erzsébet Csuhaj-Varjú,Martin Dietzfelbinger,Zoltán
视频video
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Mathematical Foundations of Computer Science 2014; 39th International S Erzsébet Csuhaj-Varjú,Martin Dietzfelbinger,Zoltán Conference proce
描述This two volume set LNCS 8634 and LNCS 8635 constitutes the refereed conference proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Programming, Algorithms, Complexity, Parallel and Distributed Computing, Quantum Computing, Automata, Grammars and Formal Languages, Combinatorics on Words, Trees and Games.
出版日期Conference proceedings 2014
关键词algebra and categories in computer science; algorithmic game theory; algorithmic learning theory; algor
版次1
doihttps://doi.org/10.1007/978-3-662-44522-8
isbn_softcover978-3-662-44521-1
isbn_ebook978-3-662-44522-8Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2014
The information of publication is updating

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




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




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




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




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




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




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




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




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




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




单选投票, 共有 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

您所在的用户组没有投票权限
发表于 2025-3-21 20:48:16 | 显示全部楼层
Marcello M. Bersani,Matteo Rossi,Pierluigi San Pietro
发表于 2025-3-22 02:42:16 | 显示全部楼层
Arturo Carpi,Gabriele Fici,Štěpán Holub,Jakub Opršal,Marinella Sciortino
发表于 2025-3-22 07:29:02 | 显示全部楼层
发表于 2025-3-22 12:47:45 | 显示全部楼层
Julien Cassaigne,Gabriele Fici,Marinella Sciortino,Luca Q. Zamboni
发表于 2025-3-22 14:01:42 | 显示全部楼层
Partial-Observation Stochastic Reachability and Parity Gamesctions invisible), or (c) they may use full randomization. We consider all these classes of games with reachability, and parity objectives that can express all .-regular objectives. The analysis problems are classified into the . analysis that asks for the existence of a strategy that ensures the ob
发表于 2025-3-22 20:55:48 | 显示全部楼层
What Does the Local Structure of a Planar Graph Tell Us About Its Global Structure?ea of Property Testing that leads to the following result (stated informally): There is a . = .(.,.) such that for any planar graph . its local structure (described by the frequency vector of .-disks) determines . up to insertion and deletion of at most .. edges (and relabelling of vertices).
发表于 2025-3-22 21:56:56 | 显示全部楼层
Towards Efficient Reasoning Under Guarded-Based Disjunctive Existential Ruleser the main guarded-based classes of disjunctive existential rules..We show that (unions of) conjunctive queries of bounded hypertree-width and of bounded treewidth do not reduce the complexity of our problem, even if we focus on predicates of bounded arity, or on fixed sets of disjunctive existenti
发表于 2025-3-23 02:42:11 | 显示全部楼层
发表于 2025-3-23 08:39:21 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-18 00:47
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表