Small-bias sample space

Known as: Epsilon-Biased Sample Spaces, Epsilon-balanced error-correcting code, Epsilon-biased sample space 
In theoretical computer science, a small-bias sample space (also known as -biased sample space, -biased generator, or small-bias probability space… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1986-2016
012319862016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Proxy signature is a useful cryptographic primitive that allows signing right delegation. In a proxy signature scheme, an… (More)
  • figure 1
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Group signatures are a central cryptographic primitive where users can anonymously and accountably sign messages in the name of a… (More)
Is this relevant?
2009
2009
We present a new approach to the infinitesimal structure of Lipschitz maps into L, and as an application, we give an alternative… (More)
Is this relevant?
Review
2009
Review
2009
184 words Text: 3883 words References: 18 entries Figures: 2 (1 panel and 6 panels) Tables: 1 (2 panels) Piecewise Mental… (More)
Is this relevant?
2005
2005
  • ISAAC PRIIXELTENSK.Y, Wilfrid Laurier
  • 2005
Hitherto, the concept of empowerment has been largely denied a place of prominence in both mainstream academic and applied… (More)
  • figure 1
Is this relevant?
2003
2003
Let {X,) be a strictly stationary &mixing process with &zl 4’/“(j) < co. It is shown in the paper that if Xi is uniformly… (More)
Is this relevant?
Review
2003
Review
2003
Volume 31, Number 1, January/February 1999 termination using methotrexate started to appear in both the medical and popular… (More)
Is this relevant?
1998
1998
Electronic cash is one of the most important applications of public-key cryptosystems. This paper gives lower bounds for data… (More)
Is this relevant?
1990
1990
This paper describes the use of computer algebra to find critical points in 2-component fluid mixtures. We describe the… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A simple parallel randomized algorithm to find a maximal independent set in a graph G = (V, E) on n vertices is presented. Its… (More)
Is this relevant?