✦ LIBER ✦

An improved Riemann mapping theorem and complexity in potential theory

✍ Scribed by Bell, Steven R.

Book ID: 111921633
Publisher: Springer Netherlands
Year: 2013
Tongue: English
Weight: 534 KB
Volume: 51
Category: Article
ISSN: 0004-2080
DOI: 10.1007/s11512-012-0168-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Ahlfors maps, the double of a domain, an

Ahlfors maps, the double of a domain, and complexity in potential theory and conformal mapping

✍ Steven R. Bell 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 741 KB

Spin field correlators on an arbitrary g

Spin field correlators on an arbitrary genus Riemann surface and non-renormalization theorems in string theories

✍ Joseph J. Atick; Ashoke Sen 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 490 KB