𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Lower bounds for arithmetic problems

✍ Scribed by João Meidânis

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
543 KB
Volume
38
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds on the Depth of Monotone Ar
Lower Bounds on the Depth of Monotone Arithmetic Computations
✍ Don Coppersmith; Baruch Schieber 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 128 KB

dedicated to zvi galil's 50th birthday Consider an arithmetic expression of length n involving only the operations [+, \_] and non-negative constants. We prove lower bounds on the depth of any binary computation tree over the same sets of operations and constants that computes such an expression. We

Lower Bounds in Minimum Rank Problems
Lower Bounds in Minimum Rank Problems
✍ Lon H. Mitchell; Sivaram K. Narayan; Andrew M. Zimmer 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 186 KB

The minimum rank of a graph is the smallest possible rank among all real symmetric matrices with the given graph. The minimum semidefinite rank of a graph is the minimum rank among Hermitian positive semidefinite matrices with the given graph. We explore connections between OS-sets and a lower bound

Herbrandizing search problems in Bounded
Herbrandizing search problems in Bounded Arithmetic
✍ Jiří Hanika 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

We study search problems and reducibilities between them with known or potential relevance to bounded arithmetic theories. Our primary objective is to understand the sets of low complexity consequences (esp. Σ b 1 or Σ b 2 ) of theories S i 2 and T i 2 for a small i, ideally in a rather strong sense