Titlebook: Stochastic Algorithms: Foundations and Applications; 4th International Sy Juraj Hromkovič,Richard Královič,Peter Widmayer Conference procee

Jurisdiction

书目名称Stochastic Algorithms: Foundations and Applications影响因子(影响力)




书目名称Stochastic Algorithms: Foundations and Applications影响因子(影响力)学科排名




书目名称Stochastic Algorithms: Foundations and Applications网络公开度




书目名称Stochastic Algorithms: Foundations and Applications网络公开度学科排名




书目名称Stochastic Algorithms: Foundations and Applications被引频次




书目名称Stochastic Algorithms: Foundations and Applications被引频次学科排名




书目名称Stochastic Algorithms: Foundations and Applications年度引用




书目名称Stochastic Algorithms: Foundations and Applications年度引用学科排名




书目名称Stochastic Algorithms: Foundations and Applications读者反馈




书目名称Stochastic Algorithms: Foundations and Applications读者反馈学科排名

Epidural-Space

https://doi.org/10.1007/978-3-540-74871-7algorithm; algorithmics; algorithms; ant colony optimization; approximation; automata; calculus; combinator

四溢

978-3-540-74870-0Springer-Verlag Berlin Heidelberg 2007

inhumane

Stochastic Algorithms: Foundations and Applications978-3-540-74871-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

用不完

0302-9743 Overview: 978-3-540-74870-0978-3-540-74871-7Series ISSN 0302-9743 Series E-ISSN 1611-3349

conscience

diskitis

免除责任

An Exponential Gap Between LasVegas and Deterministic Sweeping Finite AutomataA two-way finite automaton is . if its input head can change direction only on the end-markers. For each . ≥ 2, we exhibit a problem that can be solved by a .(..)-state sweeping . automaton, but needs 2. states on every sweeping . automaton.

crease

On Computation and Communication with Small Bias translates the acceptance probability of quantum protocols to polynomials. We will discuss some complexity theoretical consequences of this separation. This presentation is bases on joined work with Nikolay Vereshchagin and Ronald de Wolf.

jocular

Hamming, Permutations and Automatamaton recognizing .. needs to have at least .. states..Unfortunately, the alphabet for these languages grows with .. In order to prove a similar result for languages in a fixed alphabet we consider a counterpart of Hamming codes for permutations of finite sets, i.e. sets of permutations such that an