Counting Quantifiers, Successor Relations, and Logarithmic Space
Author:
- Kousha EtessamiKEKousha Etessami
- 1 June 1997
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 54 (3) , 400-411
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Reachability and the power of local ordering1994
- A first-order isomorphism theorem1993
- An optimal lower bound on the number of variables for graph identificationCombinatorica, 1992
- On uniformity within NC1Journal of Computer and System Sciences, 1990
- Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classesJournal of Computer and System Sciences, 1988
- Problems complete for deterministic logarithmic spaceJournal of Algorithms, 1987
- Almost optimal lower bounds for small depth circuits1986
- Parity, circuits, and the polynomial-time hierarchyTheory of Computing Systems, 1984
- ∑11-Formulae on finite structuresAnnals of Pure and Applied Logic, 1983
- Space Lower Bounds for Maze Threadability on Restricted MachinesSIAM Journal on Computing, 1980