Titlebook: Computing with New Resources; Essays Dedicated to Cristian S. Calude,Rūsi?? Freivalds,Iwama Kazuo Book 2014 Springer International Publish

只看該作者 · 發(fā)表于 2025-3-31 01:34:12

Computing Boolean Functions via Quantum HashingIn this paper we show a computational aspect of the quantum hashing technique. In particular we apply it for computing Boolean functions in the model of read-once quantum branching programs based on the properties of specific polynomial presentation of those functions.

只看該作者 · 發(fā)表于 2025-3-31 06:42:42

只看該作者 · 發(fā)表于 2025-3-31 10:18:02

Counting with Probabilistic and Ultrametric Finite Automatalanguage .. We also review the known results for other types of automata..For one-way probabilistic automata, we construct a minimal .-state automaton for counting to . with isolated cutpoint (but with decreasing isolation radius as . increases). We construct a two-way probabilistic automaton that c

只看該作者 · 發(fā)表于 2025-3-31 15:32:22

只看該作者 · 發(fā)表于 2025-3-31 18:12:56

只看該作者 · 發(fā)表于 2025-3-31 21:45:34

		自動登錄	找回密碼
密碼			To register

關(guān)于派博傳思			派博傳思旗下網(wǎng)站			友情鏈接
派博傳思介紹	公司地理位置	論文服務(wù)流程	影響因子官網(wǎng)	吾愛論文網(wǎng)	大講堂	北京大學(xué)	Oxford Uni.	Harvard Uni.
發(fā)展歷史沿革	期刊點評	投稿經(jīng)驗總結(jié)	SCIENCEGARD	IMPACTFACTOR	派博系數(shù)	清華大學(xué)	Yale Uni.	Stanford Uni.
\|Archiver\|手機(jī)版\|小黑屋\| 派博傳思國際 ( 京公網(wǎng)安備110108008328) GMT+8, 2025-10-11 12:01
Copyright © 2001-2015 派博傳思京公網(wǎng)安備110108008328 版權(quán)所有 All rights reserved