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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1987-2017
05010019872017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
The dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes which is undergoing a sequence… (More)
Is this relevant?
2012
2012
This article presents constructions of useful concurrent data structures, including max registers and counters, with step… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
We present a two-round argument system for NP languages with polylogarithmic communication complexity. We introduce a novel… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We show that every language in NP has a probabilistically checkable proof of proximity (i.e., proofs asserting that an instance… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
In [12] a private approximation of a function f is defined to be another function F that approximates f in the usual sense, but… (More)
Is this relevant?
Highly Cited
2003
Highly Cited
2003
We provide the first hardness result of a polylogarithmic approximation ratio for a natural NP-hard optimization problem. We show… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The group Steiner tree problem is a generalization of the Steiner tree problem where we are given several subsets (groups) of… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We give algorithms for the computation of the d-th digit of certain transcendental numbers in various bases. These algorithms can… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
This paper solves a longstanding open problem in fully dynamic algorithms: We present the first fully dynamic algorithms that… (More)
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… (More)
Is this relevant?