Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NC

Feasible Mathematics ◽

10.1007/978-1-4612-3466-1_4 ◽

1990 ◽

pp. 49-69 ◽

Cited By ~ 25

Author(s):

Peter G. Clote

Keyword(s):

Sequential Machine ◽

Complexity Classes ◽

Parallel Complexity

Download Full-text

A New Pebble Game that Characterizes Parallel Complexity Classes

SIAM Journal on Computing ◽

10.1137/0218036 ◽

1989 ◽

Vol 18 (3) ◽

pp. 533-549 ◽

Cited By ~ 24

Author(s):

H. Venkateswaran ◽

Martin Tompa

Keyword(s):

Complexity Classes ◽

Parallel Complexity ◽

Pebble Game

Download Full-text

A new pebble game that characterizes parallel complexity classes

27th Annual Symposium on Foundations of Computer Science (sfcs 1986) ◽

10.1109/sfcs.1986.2 ◽

1986 ◽

Cited By ~ 1

Author(s):

H. Venkateswaran ◽

Martin Tompa

Keyword(s):

Complexity Classes ◽

Parallel Complexity ◽

Pebble Game

Download Full-text

A Parallel Complexity Model for Functional Languages.

10.21236/ada288589 ◽

1994 ◽

Author(s):

Guy Belloch ◽

John Greiner

Keyword(s):

Functional Languages ◽

Parallel Complexity

Download Full-text

Logical Decision Problems and Complexity of Logic Programs

Fundamenta Informaticae ◽

10.3233/fi-1987-10102 ◽

1987 ◽

Vol 10 (1) ◽

pp. 1-33

Author(s):

Egon Börger ◽

Ulrich Löwen

Keyword(s):

Fixed Point ◽

Computational Complexity ◽

Decision Problem ◽

Decision Problems ◽

Complexity Classes ◽

Logic Programs ◽

Finite Structures ◽

Syntactic Restrictions

We survey and give new results on logical characterizations of complexity classes in terms of the computational complexity of decision problems of various classes of logical formulas. There are two main approaches to obtain such results: The first approach yields logical descriptions of complexity classes by semantic restrictions (to e.g. finite structures) together with syntactic enrichment of logic by new expressive means (like e.g. fixed point operators). The second approach characterizes complexity classes by (the decision problem of) classes of formulas determined by purely syntactic restrictions on the formation of formulas.

Download Full-text