By Topic

DSPACE [nk]=VAR[k+1]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Immerman, N. ; Dept. of Comput. & Inf. Sci., Massachusetts Univ., Amherst, MA, USA

The author proves that the set of properties checkable by a Turing machine in DSPACE[nk] is exactly equal to the set of properties describable by a uniform sequence of first-order sentences using at most k+1 distinct variables. He proves that this is also equal to the set of properties describable using an iterative definition for a finite set of relations of arity k. This is a refinement of the theorem PSPACE=VAR[O[1]]. The author suggests some directions for exploiting this result to derive tradeoffs between the number of variables and the quantifier-depth in descriptive complexity. This has applications to parallel complexity

Published in:

Structure in Complexity Theory Conference, 1991., Proceedings of the Sixth Annual

Date of Conference:

30 Jun-3 Jul 1991