✦ LIBER ✦

An analogue of Feller's theorem for logarithmic combinatorial assemblies

✍ Scribed by E. Manstavičius; J. Norkūnienė

Publisher: Springer
Year: 2008
Tongue: English
Weight: 180 KB
Volume: 48
Category: Article
ISSN: 0363-1672
DOI: 10.1007/s10986-008-9024-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The law of iterated logarithm for logari

The law of iterated logarithm for logarithmic combinatorial assemblies

✍ J. Norkūunienė 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 127 KB

On an analog of Feller's theorem for mul

On an analog of Feller's theorem for multiple sums

✍ O. I. Klesov 📂 Article 📅 1994 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 307 KB

An analogue of Stickelberger's theorem f

An analogue of Stickelberger's theorem for the higherK-groups

✍ J. Coates; W. Sinnott 📂 Article 📅 1974 🏛 Springer-Verlag 🌐 English ⚖ 551 KB

An analogue of Beurling’s theorem for th

An analogue of Beurling’s theorem for the Jacobi transform

✍ Ji Zheng Huang; He Ping Liu; Jian Ming Liu 📂 Article 📅 2008 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 206 KB

Looking for an Analogue of Rice's Theore

Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory

✍ Bernd Borchert; Frank Stephan 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 223 KB 👁 1 views

Rice's Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting property of circuits is UP-hard with respect to polynomial-time Turing reductions. For generators [31] we show a perfect a

An Analogue of Montel's Theorem for Rati

An Analogue of Montel's Theorem for Rational Functions of Best Lp- Approximation

✍ R.K. Kovacheva; J. Ławrynowicz 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 163 KB