Материалов:
1 005 012

Репозиториев:
30

Авторов:
596 024

По вашему запросу найдено документов: 15412

Страница 1 из 1542

Lower bounds for one-way probabilistic communication complexity and their application to space complexityWe prove three different types of complexity lower bounds for the one-way unbounded

Models of lower-bounds proofsTwo models of proofs of lower bounds on the complexity are introduced. They have very wide

Lower bounds for the expected sample size of sequential procedures for selecting and ranking of binomial and Poisson populations for the cases of binomial and Poisson populations. Our main goal is to construct lower bounds for the expected

Lower bounds for one-way probabilistic communication complexity and their application to space complexityWe prove three different types of complexity lower bounds for the one-way unbounded

Models of lower-bounds proofsTwo models of proofs of lower bounds on the complexity are introduced. They have very wide

Lower bounds for the expected sample size of sequential procedures for selecting and ranking of binomial and Poisson populations for the cases of binomial and Poisson populations. Our main goal is to construct lower bounds for the expected

Lower bounds for expected sample size of sequential procedures for the multinomial selection problems© 2017 Taylor & Francis Group, LLC. In this article, lower bounds for expected sample size

Lower bound for the average sample size and the efficiency of ranking sequential procedures© 2014 Society for Industrial and Applied Mathematics. Some bounds for the average sample size

Lower bounds for expected sample size of sequential procedures for the multinomial selection problems© 2017 Taylor & Francis Group, LLC. In this article, lower bounds for expected sample size

Lower bounds for average sample size and efficiency of sequential selection proceduresIn this paper we establish lower bounds for average sample size in procedures for selecting a

Страница 1 из 1542