Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,415,232 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
7 relations
Algorithm
Approximate max-flow min-cut theorem
Computer science
Kinetic data structure
Expand
Broader (1)
Analysis of algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Efficient Structured Matrix Recovery and Nearly-Linear Time Algorithms for Solving Inverse Symmetric M-Matrices
Arun Jambulapati
,
Kirankumar Shiragur
,
Aaron Sidford
arXiv.org
2018
Corpus ID: 56482350
In this paper we show how to recover a spectral approximations to broad classes of structured matrices using only a…
Expand
2018
2018
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with nε Memory per Machine
Manuela Fischer
,
J. Uitto
arXiv.org
2018
Corpus ID: 3629116
Recently, studying fundamental graph problems in the \emph{Massive Parallel Computation (MPC)} framework, inspired by the \emph…
Expand
2018
2018
Toward Super-Polynomial Size Lower Bounds for Depth-Two Threshold Circuits
Lijie Chen
arXiv.org
2018
Corpus ID: 44112214
Proving super-polynomial size lower bounds for $\textsf{TC}^0$, the class of constant-depth, polynomial-size circuits of Majority…
Expand
2017
2017
Efficient Approximate Distance Oracles for Vertex-Labeled Planar Graphs
Itay Laish
,
S. Mozes
arXiv.org
2017
Corpus ID: 125821979
Let $G$ be a graph where each vertex is associated with a label. A Vertex-Labeled Approximate Distance Oracle is a data structure…
Expand
2013
2013
A BDDC Algorithm for Raviart-Thomas Vector Fields.
C. Dohrmann
,
Duk-Soon Oh
,
O. Widlund
2013
Corpus ID: 126313372
A BDDC preconditioner is defined by a coarse component, expressed in terms of primal constraints and a weighted average across…
Expand
2011
2011
Approximating Node-Connectivity Augmentation Problems
Zeev Nutov
Algorithmica
2011
Corpus ID: 253977998
We consider the (undirected) Node Connectivity Augmentation (NCA) problem: given a graph J=(V,EJ) and connectivity requirements…
Expand
2004
2004
Bypassing the Embedding: Approximation schemes and Compact Representations for Low Dimensional Metrics
Kunal Talwar
2004
Corpus ID: 15203712
The doubling dimension of a metric is the smallest k such that any ball of radius 2r can be covered using 2 k balls of radius r…
Expand
2002
2002
Location management handoff overhead in hierarchically organized mobile ad hoc networks
J. Sucec
,
I. Marsic
Proceedings 16th International Parallel and…
2002
Corpus ID: 18985936
Control overhead in a mobile ad hoc network may be reduced through hierarchical routing. However, to facilitate packet forwarding…
Expand
1992
1992
On the Complexity of Polynomial Zeros
Dario Bini
,
L. Gemignani
SIAM journal on computing (Print)
1992
Corpus ID: 19756455
The parallel complexity of the simultaneous approximation to all the zeros of a polynomial is investigated. By modifying and…
Expand
1991
1991
Efficient parallel independent subsets and matrix factorizations
W. Eberly
Proceedings of the Third IEEE Symposium on…
1991
Corpus ID: 365085
A parallel algorithm is given for computation of a maximal linearly independent subset of a set of vectors over a field. The…
Expand