標(biāo)題: Titlebook: Computer Science -- Theory and Applications; First International Dima Grigoriev,John Harrison,Edward A. Hirsch Conference proceedings 2006 [打印本頁] 作者: 烏鴉 時間: 2025-3-21 18:30
書目名稱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 時間: 2025-3-21 21:38
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 時間: 2025-3-22 00:38 作者: 諂媚于性 時間: 2025-3-22 06:29 作者: prosperity 時間: 2025-3-22 10:57 作者: Peak-Bone-Mass 時間: 2025-3-22 13:33
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 時間: 2025-3-22 18:20
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.作者: 不公開 時間: 2025-3-22 21:28
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 時間: 2025-3-23 03:48
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.作者: 有罪 時間: 2025-3-23 05:50 作者: 激勵 時間: 2025-3-23 12:31
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/c/image/233826.jpg作者: 指數(shù) 時間: 2025-3-23 15:19
Computer Science -- Theory and Applications978-3-540-34168-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: cylinder 時間: 2025-3-23 19:22 作者: 暫時過來 時間: 2025-3-24 00:56
The Chinese Economy in the 1990sovel combination of two known techniques. One technique is the analysis of Hankel matrices representing bilinear forms defined by linear combinations of the coefficients of the polynomial product. The other technique is a counting argument from the coding theory.作者: glowing 時間: 2025-3-24 03:41
https://doi.org/10.1007/978-1-349-22199-8ogorov-Loveland random reals, and having the same computably random reals. In particular, we show that, when restricted to the class of strongly positive generalized Bernoulli measures, they all coincide with the classical equivalence, which requires that two measures have the same nullsets.作者: 換話題 時間: 2025-3-24 09:24
China’s Grain Economy and Trade Policyynomial–time algorithms to substantiate this model are described in zero–characteristic. The main result here is a construction of the intersection of algebraic varieties. As applications we get efficient algorithms for constructing the smooth stratification and smooth cover of an algebraic variety introduced by the author earlier.作者: parallelism 時間: 2025-3-24 14:16
https://doi.org/10.1007/11753728Automat; Hardware; algorithms; artificial intelligence; automata; complexity; computer architecture; comput作者: Binge-Drinking 時間: 2025-3-24 16:10 作者: Hamper 時間: 2025-3-24 22:24
Development of the Stock Markets,tion usually done in a . fashion. By this we mean that there is an algorithm that can solve the hard problem given any black-box for breaking the scheme..This lecture concerns exceptions to this rule: that is, schemes that are proven secure using a non-black-box reduction, that actually uses the cod作者: Irrepressible 時間: 2025-3-25 03:10 作者: 摻假 時間: 2025-3-25 03:53 作者: 不能約 時間: 2025-3-25 10:03 作者: reception 時間: 2025-3-25 12:56
Development of the Stock Markets,ributed control structure called an asynchronous automaton. This paper gives a new algorithm for the synthesis of a non-deterministic asynchronous automaton from a regular Mazurkiewicz trace language. Our approach is based on an unfolding procedure that improves the complexity of Zielonka’s and Pigh作者: 羽毛長成 時間: 2025-3-25 18:29
https://doi.org/10.1007/978-1-349-22199-8is paper we investigate applications of the linear matroid parity algorithm to the Steiner tree problem for two classes of graphs: where the terminals form a vertex cover and where terminals form a dominating set. As all these problems are MAX-SNP-hard, the issue is what approximation can be obtaine作者: legacy 時間: 2025-3-25 22:54 作者: synchronous 時間: 2025-3-26 02:00
https://doi.org/10.1007/978-1-349-22199-8ogorov-Loveland random reals, and having the same computably random reals. In particular, we show that, when restricted to the class of strongly positive generalized Bernoulli measures, they all coincide with the classical equivalence, which requires that two measures have the same nullsets.作者: 激勵 時間: 2025-3-26 06:08
https://doi.org/10.1007/978-1-349-22199-8no tilings and are indeed equivalent to perfect matchings of planar graphs. We use ., a notion previously introduced by Thurston in [10] for domino tilings, to prove that a dimer tiling of a given domain can be computed using any Single-Source-Shortest-Paths algorithm on a planar graph. We also endo作者: 極小量 時間: 2025-3-26 09:33 作者: sebaceous-gland 時間: 2025-3-26 15:43 作者: 自戀 時間: 2025-3-26 19:28
China’s Grain Economy and Trade Policyynomial–time algorithms to substantiate this model are described in zero–characteristic. The main result here is a construction of the intersection of algebraic varieties. As applications we get efficient algorithms for constructing the smooth stratification and smooth cover of an algebraic variety 作者: 熒光 時間: 2025-3-27 00:22 作者: 灰姑娘 時間: 2025-3-27 05:10 作者: 遷移 時間: 2025-3-27 07:27
Complexity of Polynomial Multiplication over Finite Fieldsovel combination of two known techniques. One technique is the analysis of Hankel matrices representing bilinear forms defined by linear combinations of the coefficients of the polynomial product. The other technique is a counting argument from the coding theory.作者: 植物茂盛 時間: 2025-3-27 12:05
Constructive Equivalence Relations on Computable Probability Measuresogorov-Loveland random reals, and having the same computably random reals. In particular, we show that, when restricted to the class of strongly positive generalized Bernoulli measures, they all coincide with the classical equivalence, which requires that two measures have the same nullsets.作者: 紅潤 時間: 2025-3-27 14:02
Efficient Algorithms in Zero-Characteristic for a New Model of Representation of Algebraic Varietiesynomial–time algorithms to substantiate this model are described in zero–characteristic. The main result here is a construction of the intersection of algebraic varieties. As applications we get efficient algorithms for constructing the smooth stratification and smooth cover of an algebraic variety introduced by the author earlier.作者: Inertia 時間: 2025-3-27 20:11 作者: antenna 時間: 2025-3-28 00:45
https://doi.org/10.1057/9780230288164nstraint types are Boolean combinations of the equality relation, and we call the corresponding constraint languages .. We show that an equality constraint language is tractable if it admits a constant unary or an injective binary polymorphism, and is NP-complete otherwise.作者: N斯巴達人 時間: 2025-3-28 04:19 作者: finite 時間: 2025-3-28 08:52 作者: floaters 時間: 2025-3-28 13:43
Development of the Stock Markets,izzini’s techniques: Our construction is polynomial in terms of the number of states but still double-exponential in the size of the alphabet. As opposed to Métivier’s work, our algorithm does not restrict to acyclic dependence alphabets.作者: Proponent 時間: 2025-3-28 18:37
https://doi.org/10.1007/978-1-349-22199-8d in polynomial time. The previously best approximation ratio for the first class of graphs (also known as unweighted quasi-bipartite graphs) is ≈ 1.217 (Gr?pl et al. [4]) is reduced in this paper to 8/7–1/160≈ 1.137. For the case of graphs where terminals form a dominating set, an approximation ratio of 4/3 is achieved.作者: Mast-Cell 時間: 2025-3-28 19:41
China’s Grain Economy and Trade Policyrelativisation of .. iterated . times provides a natural separation between Res(.) and Res(.+1). We prove the same result for the iterated relativisation of .. if the tree-like proof system Res*(.) is considered instead of Res (.).作者: 尖 時間: 2025-3-29 02:28 作者: Obligatory 時間: 2025-3-29 06:15 作者: arcane 時間: 2025-3-29 10:59
Relativisation Provides Natural Separations for Resolution-Based Proof Systemsrelativisation of .. iterated . times provides a natural separation between Res(.) and Res(.+1). We prove the same result for the iterated relativisation of .. if the tree-like proof system Res*(.) is considered instead of Res (.).作者: Plaque 時間: 2025-3-29 11:46 作者: 彎彎曲曲 時間: 2025-3-29 17:14
https://doi.org/10.1007/978-1-349-22199-8for all . ≥ 2. Further, this is equivalent to the existence of a propositional proof system in which the disjointness of all .-tuples is shortly provable. We also show that a strengthening of this conditions characterizes the existence of optimal proof systems.作者: 使成波狀 時間: 2025-3-29 21:57 作者: CEDE 時間: 2025-3-29 23:55 作者: 愛得痛了 時間: 2025-3-30 05:53 作者: Anthropoid 時間: 2025-3-30 08:38 作者: Archipelago 時間: 2025-3-30 14:21
Development of the Stock Markets,eve when restricting to black-box reductions. In particular, we will present constructions of zero-knowledge protocols that are proven secure under various compositions [1, 2, 3] ..We’ll also discuss some of the limitations and open questions regarding non-black-box security proofs.作者: 大雨 時間: 2025-3-30 17:51 作者: esthetician 時間: 2025-3-30 23:46
Haiyan Song,Xiaming Liu,Peter Romillyolves both vertex- and edge-colourings of the graph ., and thus allows to express .-complete problems (while .-moteness is always in .). We finally extend our result to arbitrary relational structures, and prove that every problem in MMSNP, restricted to connected inputs of bounded (hyper-graph) degree, is in fact in CSP.作者: 諷刺 時間: 2025-3-31 02:27 作者: defeatist 時間: 2025-3-31 06:42 作者: 含糊其辭 時間: 2025-3-31 10:01
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problemsolves both vertex- and edge-colourings of the graph ., and thus allows to express .-complete problems (while .-moteness is always in .). We finally extend our result to arbitrary relational structures, and prove that every problem in MMSNP, restricted to connected inputs of bounded (hyper-graph) degree, is in fact in CSP.作者: Mast-Cell 時間: 2025-3-31 16:11 作者: scoliosis 時間: 2025-3-31 19:22 作者: Affectation 時間: 2025-3-31 22:20 作者: 格言 時間: 2025-4-1 05:00
Inductive Type Schemas as Functorss between parameters one can construct a function between the instantiated inductive types representing the change of parameters along these functions. It is well known that it is not a functor w.r.t. intensional equality based on standard reductions. We investigate a simple type system with inducti作者: SLUMP 時間: 2025-4-1 09:05
Unfolding Synthesis of Asynchronous Automataributed control structure called an asynchronous automaton. This paper gives a new algorithm for the synthesis of a non-deterministic asynchronous automaton from a regular Mazurkiewicz trace language. Our approach is based on an unfolding procedure that improves the complexity of Zielonka’s and Pigh
