In computational complexity theory and cryptography, averaging argument is a standard argument for proving theorems. It usually allows us to convert… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2013

2013

- Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh
- Oper. Res. Lett.
- 2013

We consider a generalization of the capacitated vehicle routing problem known as the cumulative vehicle routing problem in the… (More)

Is this relevant?

2009

2009

- Ronen Shaltiel
- computational complexity
- 2009

A simple averaging argument shows that given a randomized algorithm A and a function f such that for every input x, Pr[A(x) = f(x… (More)

Is this relevant?

2008

2008

- W. T. Gowers
- Combinatorics, Probability & Computing
- 2008

Babai and Sos have asked whether there exists a constant c > 0 such that every finite group G has a product-free subset of size… (More)

Is this relevant?

2007

2007

- Vasile Sinescu, Stephen Joe
- Math. Comput.
- 2007

We study the problem of constructing rank-1 lattice rules which have good bounds on the “weighted star discrepancy”. Here the non… (More)

Is this relevant?

2007

2007

- Da-ke He, L. A. Lastras-Montano, En-hui Yang
- 2007 IEEE International Symposium on Information…
- 2007

The Slepian-Wolf coding problem is often viewed as a channel coding problem for the purpose of gaining insight into its… (More)

Is this relevant?

2005

2005

- Alvaro Alvarez-Parrilla
- Int. J. Math. Mathematical Sciences
- 2005

An explicit construction of a geodesic flow-invariant distribution lying in the discrete series of weight 2k isotopic component… (More)

Is this relevant?

2004

2004

- Yaron Shany
- IEEE Transactions on Information Theory
- 2004

We consider asymptotically good nonlinear codes recently introduced by Xing (2003). The original definition of these codes relies… (More)

Is this relevant?

Review

2002

Review

2002

Linear codes over Fq are considered for use in detecting and in correcting the additive errors in some subset E of Fn q . (The… (More)

Is this relevant?

2002

2002

- Pierre Rouchon
- 2002

where ψ is the complex probability amplitude vector (belongs to an Hilbet space of finite or infinite dimension), H0 is the free… (More)

Is this relevant?

1996