找回密碼
 To register

QQ登錄

只需一步,快速開始

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

打印 上一主題 下一主題

Titlebook: Computer Science - Theory and Applications; 8th International Co Andrei A. Bulatov,Arseny M. Shur Conference proceedings 2013 Springer-Verl

[復(fù)制鏈接]
樓主: 要旨
11#
發(fā)表于 2025-3-23 10:42:20 | 只看該作者
Information Lower Bounds via Self-reducibility: Gap Hamming Distance (GHD) and Inner Product (IP). In our first result we affirm the conjecture that the information cost of GHD : is linear even under the .distribution, which strengthens the Ω(.) bound recently shown by [15], and answering an open problem from [10]. In our second result we prove
12#
發(fā)表于 2025-3-23 16:34:31 | 只看該作者
On the Encoding Invariance of Polynomial Time Computable Distribution Ensemblesness, which is more convenient than previously used polynomial time computable distributions (PComp). The notion of a PISamp distribution is encoding invariant, while PComp distributions are not, if one-way permutations exist. Here we prove that PComp distributions are not encoding invariant under a
13#
發(fā)表于 2025-3-23 20:53:31 | 只看該作者
14#
發(fā)表于 2025-3-23 23:40:05 | 只看該作者
Amortized Communication Complexity of an Equality Predicate complexity of this problem is equal to .(.); the computational complexity of the proposed protocol is polynomial in the size of inputs. Our protocol improves the result achieved in 1991 by Feder et al. Our construction is based on two techniques: Nisan’s pseudorandom generator (1992, Nisan) and Smi
15#
發(fā)表于 2025-3-24 05:26:03 | 只看該作者
Careful Synchronization of Partial Automata with Restricted Alphabetse finite automata. We obtain a lower bound for the length of the shortest carefully synchronizing words of an automaton with a fixed number of states and a fixed number of letters. In particular, we consider this bound for automata over a binary alphabet. Our results improve previously known bounds.
16#
發(fā)表于 2025-3-24 07:59:06 | 只看該作者
17#
發(fā)表于 2025-3-24 13:37:01 | 只看該作者
18#
發(fā)表于 2025-3-24 18:38:59 | 只看該作者
Conference proceedings 2013013. The 29 full papers presented in this volume were carefully reviewed and selected from 52 submissions. In addition the book contains 8 invited lectures. The papers are organized in topical sections on: algorithms; automata; logic and proof complexity; complexity; words and languages; and logic and automata.
19#
發(fā)表于 2025-3-24 20:22:20 | 只看該作者
20#
發(fā)表于 2025-3-24 23:56:58 | 只看該作者
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233827.jpg
 關(guān)于派博傳思  派博傳思旗下網(wǎng)站  友情鏈接
派博傳思介紹 公司地理位置 論文服務(wù)流程 影響因子官網(wǎng) 吾愛論文網(wǎng) 大講堂 北京大學(xué) Oxford Uni. Harvard Uni.
發(fā)展歷史沿革 期刊點(diǎn)評 投稿經(jīng)驗(yàn)總結(jié) SCIENCEGARD IMPACTFACTOR 派博系數(shù) 清華大學(xué) Yale Uni. Stanford Uni.
QQ|Archiver|手機(jī)版|小黑屋| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-20 17:23
Copyright © 2001-2015 派博傳思   京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved
快速回復(fù) 返回頂部 返回列表
汝阳县| 罗甸县| 格尔木市| 太谷县| 华容县| 延安市| 开阳县| 唐海县| 南皮县| 邮箱| 奉贤区| 宜昌市| 绥中县| 赤城县| 勐海县| 揭阳市| 靖远县| 萨嘎县| 大连市| 土默特左旗| 新乐市| 姚安县| 禹城市| 叶城县| 庐江县| 绥德县| 五河县| 衡阳县| 盐津县| 广平县| 余干县| 田东县| 黄龙县| 渝北区| 新晃| 开远市| 长治县| 讷河市| 盐城市| 侯马市| 汕头市|