A new pebble game that characterizes parallel complexity classes

1986 ◽  
Author(s):  
H. Venkateswaran ◽  
Martin Tompa
Keyword(s):  
Complexity Classes ◽  
Parallel Complexity ◽  
Pebble Game

A New Pebble Game that Characterizes Parallel Complexity Classes

1989 ◽  
Vol 18 (3) ◽  
pp. 533-549 ◽  
Author(s):  
H. Venkateswaran ◽  
Martin Tompa
Keyword(s):  
Complexity Classes ◽  
Parallel Complexity ◽  
Pebble Game

Logical Decision Problems and Complexity of Logic Programs

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.

Completeness for nondeterministic complexity classes

1991 ◽  
Vol 24 (1) ◽  
pp. 179-200 ◽  
Author(s):  
Harry Buhrman ◽  
Steven Homer ◽  
Leen Torenvliet
Keyword(s):  
Complexity Classes

scholarly journals Languages that Capture Complexity Classes

1987 ◽  
Vol 16 (4) ◽  
pp. 760-778 ◽  
Author(s):  
Neil Immerman
Keyword(s):  
Complexity Classes

scholarly journals Computing over the Reals with Addition and Order: Higher Complexity Classes

1995 ◽  
Vol 11 (3) ◽  
pp. 358-376 ◽  
Author(s):  
F. Cucker ◽  
P. Koiran
Keyword(s):  
Complexity Classes
Sign in / Sign up

Export Citation Format

Share Document