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
-
261by Richter, Gregor“... the prevalence of multiple polylogarithms and multiple zeta values in low order Feynman diagram computations...”
Published 2018
Get full text
Get full text
Get full text
Doctoral Thesis -
262by Makur, Anuran.“... or randomized polylogarithmic time in the depth. Lastly, we show that broadcasting is impossible for certain two...”
Published 2019
Get full text
Others -
263Hybrid Multi-Access Protocols for Real-Time Transmission and Power Conservation in Wireless Networks“... with the polylogarithmic broadcast algorithm. (ii) On the basis of DCB, we then propose several different multi-channel...”
Get full text
Others -
264by Zhang, Wuzhou“... an index of near-linear size and answer ENN queries in polylogarithmic or sublinear time, depending...”
Published 2015
Get full text
-
265by Raykova, Mariana Petrova“... access machines to construct MPC protocols that add only polylogarithmic overhead to the running time...”
Published 2012
Get full text
-
266by Woodruff, David Paul, 1980-“..., and is optimal up to polylogarithmic factors. As a special case our algorithm can be used to approximate...”
Published 2008
Get full text
Others -
267by Saban, Daniela“...^*(1/n^{1/K}), where polylogarithmic factors have been suppressed. Further, we show that this bound...”
Published 2015
Get full text
-
268by Onak, Krzysztof (Krzysztof Piotr)“... strings to within a polylogarithmic factor. For strings of length n and every fixed E > 0, the algorithm...”
Published 2011
Get full text
Others -
269by Touchette, Dave“... for quantum protocols, and a tight lower bound, up to polylogarithmic terms, for the bounded-round quantum...”
Published 2015
Get full text