On Simultaneous Resource Bounds (Preliminary Version)

It is well known that time bounds for machines correspond closely to size bounds for networks, and that space bounds correspond to depth bounds. It is not known whether simultaneous time and space bounds correspond to simultaneous size and depth bounds. It is shown here that simultaneous time and "reversal" bounds correspond to simultaneous size and depth bounds, and that simultaneous time and space bounds correspond to simultaneous size and "width" bounds.

Authors

• Nicholas Pippenger

Keywords

• Computer networks
• Logic
• Polynomials
• Time And Space
• Input Length
• Proof Sketch
• Output Length