Vinay, V and Venkateswaran, H and Madhavan, Veni CE (1990) Circuits, Pebbling and Expressibility. In: Fifth Annual Structure in Complexity Theory Conference, 1990, 8-11 July, Barcelona, pp. 223-230.
We give characterizations of nondeterministic complexity classes such as NP and PSPACE and the classes in the polynomial time hierarchy in the two person pebble game model [VT89]. These characterizations motivate the definitions of these classes using first order sentences extending the results in [Im82]. It is shown that the role-switches resource in the pebble games closely model the levels of the polynomial hierarchy. These characterizations are made possible by explicitly considering circuit-size in the pebbling characterizations and the size of the underlying universe in the first-order characterizations.
|Item Type:||Conference Paper|
|Additional Information:||Copyright 1990 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Computer Science & Automation (Formerly, School of Automation)|
|Date Deposited:||30 May 2006|
|Last Modified:||19 Sep 2010 04:27|
Actions (login required)