Results 181 to 190 of about 562 (207)

The Bloch-Wigner-Ramakrishnan polylogarithm function

Mathematische Annalen, 1990
The dilogarithm function Li\\sb 2(z)=\\sum\\sp∞\\sbn=1z\\sp n/n\\sp 2 (\\vert z\\vert lt;1) has many beautiful properties and plays a role in connection with problems in many parts of mathematics, most recently K-theory.
Don Zagier
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

A polylogarithmic approximation of the minimum bisection

Proceedings 41st Annual Symposium on Foundations of Computer Science, 2002
Summary: A bisection of a graph with \(n\) vertices is a partition of its vertices into two sets, each of size \(n/2\). The bisection cost is the number of edges connecting the two sets. It is known that finding a bisection of minimum cost is NP-hard.
Uriel Feige, Robert Krauthgamer
openaire   +4 more sources

A Novel Approach to the Discovery of Binary BBP-Type Formulas for Polylogarithm Constants

Integers, 2012
.Using a clear and straightforward approach, we discover and prove new binary digit extraction BBP-type formulas for polylogarithm constants. Some known results are also rediscovered in a more direct and elegant manner. Numerous experimentally discovered
Kunle Adegoke
exaly   +2 more sources

Identities for Generalized Polylogarithms

Mathematical Notes, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Network synchronization with polylogarithmic overhead

Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science, 2002
The synchronizer is a simulation methodology for simulating a synchronous network by an asynchronous one, thus enabling the execution of a synchronous algorithm on an asynchronous network. Previously known synchronizers require each processor in the network to participate in each pulse of the synchronization process.
Baruch Awerbuch, David Peleg
openaire   +2 more sources

Explicit OR-dispersers with polylogarithmic degree

Journal of the ACM, 1998
An ( N, M, T )-OR-disperser is a bipartite multigraph G =( V, W, E ) with | V | = N , and | W | = M , having the following expansion property: any subset of V
Saks, M., Srinivasan, A., Zhou, S.
openaire   +3 more sources

On polylogarithms

Publicationes Mathematicae Debrecen, 2022
openaire   +2 more sources

A Note on Symbolic Integration with Polylogarithms

Mediterranean Journal of Mathematics, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Explicit evaluation of some integrals involving polylogarithm functions

Integral Transforms and Special Functions, 2022
Rusen Li
exaly  

On the numerical calculation of polylogarithms

BIT, 1972
Lambert, Franklin, Jacobs, Danielle
openaire   +2 more sources