Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Polylogarithmic function

Known as: Polylogarithmic 
A polylogarithmic function in n is a polynomial in the logarithm of n, In computer science, polylogarithmic functions occur as the order of memory… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
We present a novel approach to fully homomorphic encryption (FHE) that dramatically improves performance and bases security on… Expand
Is this relevant?
Highly Cited
2012
Highly Cited
2012
We show that homomorphic evaluation of (wide enough) arithmetic circuits can be accomplished with only polylogarithmic overhead… Expand
  • figure 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Consider an <i>n</i>-vertex graph <i>G = (V,E)</i> of maximum degree Δ, and suppose that each vertex <i>v</i> ∈ <i>V</i> hosts a… Expand
  • figure 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We give an improved explicit construction of highly unbalanced bipartite expander graphs with expansion arbitrarily close to the… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We show that integrals of the form ∫ 0 1 x m Li p (x)Li q (x)dx (m ≥ -2,p,q ≥ 1) and ∫ 0 1 log r (x)Li p (x)Li q (x) / x dx (p, q… Expand
  • table 8
  • table 9
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We study the setting in which a user stores encrypted documents (e.g. e-mails) on an untrusted server. In order to retrieve… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity… Expand
Is this relevant?
Highly Cited
1995
Highly Cited
1995
We describe schemes that enable a user to access k replicated copies of a database (k/spl ges/2) and privately retrieve… Expand
  • figure 1
Is this relevant?
Highly Cited
1991
Highly Cited
1991
Motivated by Manuel Blum’s concept of inst ante checking, we consider new, very fast and generic mechanisms of checking… Expand
Is this relevant?
Highly Cited
1985
Highly Cited
1985
The author presents a new class of universal routing networks, called fat-trees, which might be used to interconnect the… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
Is this relevant?