𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Applications of matrix methods to the theory of lower bounds in computational complexity

✍ Scribed by A. A. Razborov

Publisher
Springer-Verlag
Year
1990
Tongue
English
Weight
739 KB
Volume
10
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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 Complexity of Funct
Lower Bounds for the Complexity of Functions in a Realistic RAM Model
✍ Nader H. Bshouty πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 127 KB

This paper develops a new technique that finds almost tight lower bounds for the complexity of programs that compute or approximate functions in a realistic RAM model. The nonuniform realistic RAM model is a model that uses the arithmetic Γ„ 4 operations q, y, = , the standard bit operation Shift, Ro