D. Kozen, "Complexity of Boolean Algebras," Theor. Comput. Sci. 10 (1980), 221-247. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Constraint Query Languages - Kanellakis, Kuper, Revesz (1990) (273 citations) (Correct)
....be evaluated bottom up in closed form and LOGSPACE (PTIME) data complexity. This extends the approach to safe queries of [3, 25, 31, 44] Section 4) 6. Finally, Datalog with boolean equality constraints can be evaluated bottom up and in closed form. For the definitions we refer to Section 5 and [10, 34, 40]. The data complexity here is higher than in the previous cases and it depends on the use of free boolean algebras with m generators. We partly analyze this data complexity and show it to be Pi p 2 hard (Section 5) 2 Real Polynomial Inequality Constraints Throughout Section 2, we assume ....
D. Kozen. Complexity of Boolean Algebras. Theo. Comp. Sci., 10, 221-247, 1980.
Constraint Query Languages - Kanellakis, Kuper, Revesz (1992) (273 citations) (Correct)
....be evaluated bottom up in closed form and LOGSPACE (PTIME) data complexity. This extends the approach to safe queries of [3, 23, 29, 42] Section 4) 6. Finally, Datalog with boolean equality constraints can be evaluated bottom up and in closed form. For the definitions we refer to Section 5 and [8, 32, 38]. The data complexity here is higher than in the previous cases and it depends on the use of free boolean algebras with m generators. We partly analyze this data complexity and show it to be Pi p 2 hard (Section 5) 2 Real Polynomial Inequality Constraints Throughout Section 2, we assume ....
D. Kozen. Complexity of Boolean Algebras. Theo. Comp. Sci., 10, 221-247, 1980.
Definability with Bounded Number of Bound Variables - Immerman, Kozen (1989) (38 citations) Self-citation (Kozen) (Correct)
....is used in the proofs below. We have reduced the problem of establishing the k variable property for Sigma to checking the condition of Corollary 4(i) This will done using Ehrenfeucht Fraisse games [3, 5] Ehrenfeucht Fraisse games have been used widely in theoretical computer science; see e.g. [4, 6, 8, 10, 12, 13, 17, 18]. Here we use a modified version in which the number of pebbles is finite [9, 14, 10] Definition 5 Let A; B be structures for L and (u; v) a k configuration. We call (u; v) a local isomorphism if the map u(x) 7 v(x) x 2 u, is well defined and extends to an isomorphism of the substructures of ....
D. Kozen, "Complexity of Boolean Algebras," Theor. Comput. Sci. 10 (1980), 221-247.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC