Titlebook: Computer Science -- Theory and Applications; First International Dima Grigoriev,John Harrison,Edward A. Hirsch Conference proceedings 2006

烏鴉

書目名稱Computer Science -- Theory and Applications影響因子(影響力)




書目名稱Computer Science -- Theory and Applications影響因子(影響力)學(xué)科排名




書目名稱Computer Science -- Theory and Applications網(wǎng)絡(luò)公開度




書目名稱Computer Science -- Theory and Applications網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computer Science -- Theory and Applications被引頻次




書目名稱Computer Science -- Theory and Applications被引頻次學(xué)科排名




書目名稱Computer Science -- Theory and Applications年度引用




書目名稱Computer Science -- Theory and Applications年度引用學(xué)科排名




書目名稱Computer Science -- Theory and Applications讀者反饋




書目名稱Computer Science -- Theory and Applications讀者反饋學(xué)科排名

Visual-Field

The Chinese Economy in the 1990sIn this paper we classify several group-theoretic computational problems into the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to this, these problems were known to be in AM ∩ coAM. As PZK ? SZK ? AM ∩ coAM, we have a tighter upper bound for these problems.

Adulate

諂媚于性

prosperity

Peak-Bone-Mass

Synchronous Elastic CircuitsSynchronous elastic circuits (also known as latency-insensitive and latency-tolerant) behave independently of the latencies of computations and communication channels.

Peak-Bone-Mass

SZK Proofs for Black-Box Group ProblemsIn this paper we classify several group-theoretic computational problems into the classes PZK and SZK (problems with perfect/statistical zero-knowledge proofs respectively). Prior to this, these problems were known to be in AM ∩ coAM. As PZK ? SZK ? AM ∩ coAM, we have a tighter upper bound for these problems.

不公開

Canonical Decomposition of a Regular Factorial LanguageWe consider decompositions of factorial languages to concatenations of factorial languages and prove that if the factorial language is regular, then so are the factors of its . decomposition.

bromide

Conjugacy and Equivalence of Weighted Automata and Functional TransducersWe show that two equivalent .-automata are conjugate to a third one, when . is equal to ., or any (skew) field and that the same holds true for functional tranducers as well.

有罪