找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Mathematical Foundations of Computer Science 1999; 24th International S Mirosław Kutyłowski,Leszek Pacholski,Tomasz Wierzb Conference proce

[复制链接]
楼主: magnify
发表于 2025-3-25 05:27:02 | 显示全部楼层
Query Languages for Real Number Databases Based on Descriptive Complexity over Rour approach is based on real number complexity theory as introduced in [.] and descriptive complexity for the latter developed in [.]. Using this formal framework a uniform treatment of query languages for such databases is obtained. Precise results about both the data- and the expression-complexit
发表于 2025-3-25 10:04:45 | 显示全部楼层
发表于 2025-3-25 14:26:21 | 显示全部楼层
发表于 2025-3-25 19:09:38 | 显示全部楼层
Efficiency of Fast Parallel Pattern Searching in Highly Compressed Textstially large with respect to its compressed version, and . means .. Given an uncompressed pattern . and a compressed version of a text ., the . problem is to test if . occurs in .. Two types of closely related compressed representations of 1-dimensional texts are considered: the Lempel-Ziv encodings
发表于 2025-3-25 21:39:45 | 显示全部楼层
Computing and Comparing Semantics of Programs in Four-Valued Logicsnot be inferred from the rules. Thus, the well founded semantics corresponds to the assumption that every such atom is false, while the Kripke-Kleene semantics corresponds to the assumption that every such atom is unknown. In this paper, we propose to unify and extend this assumption-based approach
发表于 2025-3-26 03:32:11 | 显示全部楼层
发表于 2025-3-26 06:04:46 | 显示全部楼层
Message Sequence Graphs and Decision Problems on Mazurkiewicz Tracesision problems concerning the correctness and the consistency of a design based by MSC graphs. Both problems are shown to be undecidable, in general. Using a natural connectivity assumption from Mazurkiewicz trace theory we show both problems to be EXPSPACE-complete for locally synchronized graphs.
发表于 2025-3-26 11:38:58 | 显示全部楼层
On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine Systemeger programming. In automated deduction, the Hilbert basis of a corresponding system serves to compute the minimal complete set of associative-commutative unifiers, whereas in integer programming the Hilbert bases are tightly connected to integer polyhedra and to the notion of total dual integralit
发表于 2025-3-26 13:51:59 | 显示全部楼层
发表于 2025-3-26 18:50:50 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-29 05:47
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表