Suggested Topics within your search.
Suggested Topics within your search.
Bramble
1
Connected Subgraph
1
Constant congestion
1
Delay operational matrix
1
Exponentials
1
Fractional delay differential equations
1
Graph G
1
High-order
1
History of engineering and technology
1
Mathematics & science
1
Operational matrix
1
Poly-Bernoulli polynomials
1
Research & information: general
1
Subgraphs
1
Tree-width
1
Undirected graph
1
Undirected graphs
1
Vertex set
1
bramble
1
constant congestion
1
delay operational matrix
1
fractional delay differential equations
1
operational matrix
1
poly-Bernoulli polynomials
1
-
221“... not needed to compute any numerical series or any integral involving polylogarithms, at any moment....”
Get full text
Article -
222“... in expectation. (iii) Furthermore, a participating node takes polylogarithmic overhead to exploit the physical...”
Get full text
Others -
223
-
224by Mach, Thomas“...-polylogarithmic complexity. This factorizations can be used to compute the inertia of an H-matrix...”
Published 2012
Get full text
Get full text
Get full text
Get full text
Doctoral Thesis -
225“... be represented by harmonic polylogarithms. We also obtain analytic results for the non–first-order factorizing...”
Get full text
Article -
226by Wang, Shannon“... explicitly in system size, the algorithm heuristically runs in polylogarithmic time. Since the inverse...”
Published 2017
Get full text
Get full text
Others -
227
-
228
-
229by Bradford, Henry“... polylogarithmic upper bounds for the diameters of finite quotients of: groups with an analytic structure over a...”
Published 2015
Get full text
-
230
-
231
-
232
-
233“... polylogarithms to weight w = 6 of argument z and (1−z) and in Mellin N space by generalized harmonic sums...”
Get full text
Article -
234by Lai, Katherine Jane“...) amortized lower bound in the worst case that we conjecture has polylogarithmic amortized performance...”
Published 2009
Get full text
Others -
235“... metrics into a space of constant dimension that achieves polylogarithmic approximation ratio....”
Get full text
Article -
236
-
237“... is polylogarithmic in the size of the groundset. Otherwise the query complexity is at most the square root...”
Get full text
Others -
238
-
239
-
240by Haeupler, Bernhard“... polylogarithmic running time using polynomially many processors. === by Bernhard Haeupler. === S.M....”
Published 2010
Get full text
Others