找回密碼
 To register

QQ登錄

只需一步,快速開始

掃一掃,訪問微社區(qū)

打印 上一主題 下一主題

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

[復制鏈接]
樓主: magnify
21#
發(fā)表于 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
22#
發(fā)表于 2025-3-25 10:04:45 | 只看該作者
23#
發(fā)表于 2025-3-25 14:26:21 | 只看該作者
24#
發(fā)表于 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
25#
發(fā)表于 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
26#
發(fā)表于 2025-3-26 03:32:11 | 只看該作者
27#
發(fā)表于 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.
28#
發(fā)表于 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
29#
發(fā)表于 2025-3-26 13:51:59 | 只看該作者
30#
發(fā)表于 2025-3-26 18:50:50 | 只看該作者
 關于派博傳思  派博傳思旗下網站  友情鏈接
派博傳思介紹 公司地理位置 論文服務流程 影響因子官網 吾愛論文網 大講堂 北京大學 Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點評 投稿經驗總結 SCIENCEGARD IMPACTFACTOR 派博系數 清華大學 Yale Uni. Stanford Uni.
QQ|Archiver|手機版|小黑屋| 派博傳思國際 ( 京公網安備110108008328) GMT+8, 2025-10-9 16:03
Copyright © 2001-2015 派博傳思   京公網安備110108008328 版權所有 All rights reserved
快速回復 返回頂部 返回列表
西华县| 栾城县| 平阳县| 乌兰浩特市| 安吉县| 克拉玛依市| 搜索| 安平县| 长泰县| 泽州县| 杂多县| 开阳县| 伊宁市| 天门市| 大余县| 全州县| 上林县| 班玛县| 阳曲县| 盐亭县| 灵石县| 和顺县| 壤塘县| 石家庄市| 南丹县| 门头沟区| 剑川县| 祁门县| 武山县| 登封市| 云阳县| 鄯善县| 黄冈市| 渭南市| 右玉县| 昌吉市| 柞水县| 日喀则市| 广灵县| 三江| 长岭县|