Title :
Time, hardware, and uniformity
Author :
Barrington, David Mix ; Immerman, Neil
Author_Institution :
Dept. of Comput. Sci., Massachusetts Univ., Amherst, MA, USA
fDate :
28 Jun- 1 Jul 1994
Abstract :
We describe three orthogonal complexity measures: parallel time, amount of hardware, and degree of non-uniformity, which together parametrize most complexity classes. We show that the descriptive complexity framework neatly captures these measures using the parameters: quantifier depth, number of variable bits, and type of numeric predicates respectively. A fairly simple picture arises in which the basic questions in complexity theory-solved and unsolved-can be understood as questions about tradeoffs among these three dimensions
Keywords :
computational complexity; theorem proving; complexity classes; complexity theory; descriptive complexity framework; hardware; nonuniformity; numeric predicates; orthogonal complexity measures; parallel time; quantifier depth; theorem proving; variable bits; Circuits; Complexity theory; Computational modeling; Computer science; Concurrent computing; Hardware; Parallel machines; Phase change random access memory; Time measurement; Turing machines;
Conference_Titel :
Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth Annual
Conference_Location :
Amsterdam
Print_ISBN :
0-8186-5670-0
DOI :
10.1109/SCT.1994.315806
