Results 191 to 200 of about 813 (211)

Ramaswami Type translation formulae for the polylogarithm functions

Parikshit Mehta, Biswajyoti Saha
openalex   +1 more source

Finite multiple polylogarithms

Finite multiple polylogarithms
openaire  

Some of the next articles are maybe not open access.

Related searches:

Polylogarithms

Oberwolfach Reports, 2005
The k -th polylogarithm function is defined on |z|<1 by Li_k(z) = \sum_{n\geq 1} \
Spencer Bloch, Guido Kings, Jörg Wildeshaus   +2 more
openaire   +1 more source

Polylogarithmic inapproximability

Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, 2003
We provide the first hardness result of a polylogarithmic approximation ratio for a natural NP-hard optimization problem. We show that for every fixed e>0, the GROUP-STEINER-TREE problem admits no efficient log2-e k approximation, where k denotes the number of groups (or, alternatively, the input size), unless NP has quasi polynomial Las-Vegas ...
Eran Halperin, Robert Krauthgamer
openaire   +1 more source

Identities for Generalized Polylogarithms

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

Rooted tree polylogarithms

Bulletin des Sciences Mathématiques
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kobata, Kumi, Tanaka, Tatsushi, Wakabayashi, Noriko   +2 more
openaire   +1 more source

Finite and ��tale polylogarithms

2016
21 pages.
Sakugawa, Kenji, Seki, Shin-ichiro
openaire   +1 more source

On modified finite polylogarithms

Journal of Number Theory, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

On polylogarithms

Publicationes Mathematicae Debrecen, 2022
openaire   +2 more sources