Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6250
Title: Number of Quantifiers is Better than Number of Tape Cells
Authors: Immerman, Neil
Keywords: computer science
technical report
Issue Date: Feb-1980
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR80-410
Abstract: We introduce a new complexity measure, $QN[f(n)]$, which clocks the size of sentences from predicate calculus needed to express a given property. Techniques from logic are used to prove sharp lower bounds in the measure. These results demonstrate space requirements for computations and may provide techniques for separating Time and Space complexity classes because we show that: $NSPACE [f(n)] \subseteq QN[f(n)^{2}/log(n)] \subseteq DSPACE[f(n)^{2}].$
URI: http://hdl.handle.net/1813/6250
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
80-410.pdf1.99 MBAdobe PDFView/Open
80-410.ps565.2 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us