๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Nonerasing, Counting, and Majority over the Linear Time Hierarchy

โœ Scribed by Arnaud Durand; Malika More

Book ID
112252668
Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
123 KB
Volume
174
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The polynomial and linear time hierarchi
The polynomial and linear time hierarchies in V0
โœ Leszek A. Koล‚odziejczyk; Neil Thapen ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 203 KB

## Abstract We show that the bounded arithmetic theory V^0^ does not prove that the polynomial time hierarchy collapses to the linear time hierarchy (without parameters). The result follows from a lower bound for bounded depth circuits computing prefix parity, where the circuits are allowed some au