✦ LIBER ✦

On lower bounds of the closeness between complexity classes

✍ Scribed by Bin Fu

Publisher: Springer
Year: 1993
Tongue: English
Weight: 669 KB
Volume: 26
Category: Article
ISSN: 1433-0490
DOI: 10.1007/bf01202282

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds on the Multiparty Communica

Lower Bounds on the Multiparty Communication Complexity

✍ Pavol Ďuriš; José D.P. Rolim 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Lower bounds on the area complexity of B

Lower bounds on the area complexity of Boolean circuits

✍ Juraj Hromkovič; Sergej A. Ložkin; Andrej I. Rybko; Alexander A. Sapoženko; Nade 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

Lower bounds on monotone complexity of t

Lower bounds on monotone complexity of the logical permanent

✍ A. A. Razborov 📂 Article 📅 1985 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 619 KB

Lower bounds for the complexity of polyn

Lower bounds for the complexity of polynomials

✍ Hans-Jörg Stoß 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 936 KB

Some Lower Bounds for the Complexity of

Some Lower Bounds for the Complexity of Continuation Methods

✍ Jean-Pierre Dedieu; Steve Smale 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 222 KB

In this note we consider the zero-finding problem for a homogeneous polynomial system, The well-determined (m=n) and underdetermined (m<n) cases are considered together. We also let D=max d i , d=(d 1 , ..., d m ), and The projective Newton method has been introduced by Shub in [6] and is defined

Lower bounds for the bilinear complexity

Lower bounds for the bilinear complexity of associative algebras

✍ M. Bläser 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 395 KB