Descriptive Complexity: A Logicians Approach to Computation
نویسنده
چکیده
structures, North Holland, 1974. [19] S. Patnaik and N. Immerman, Dyn-FO: A parallel, dynamic complexity class, ACM Symp. Principles Database Systems (1994), 210–221. [20] W. J. Savitch, Relationships between nondeterministic and deterministic tape complexities, J. Comput. System Sci. 4 (1970), 177–192. [21] R. Szelepcsenyi, The method of forced enumeration for nondeterministic automata, Acta Informatica 26 (1988), 279–284. [22] M. Vardi, Complexity of relational query languages, 14th ACM STOC Symp. (1982), 137–146.
منابع مشابه
Team Semantics and Recursive Enumerability
It is well known that dependence logic captures the complexity class NP, and it has recently been shown that inclusion logic captures P on ordered models. These results demonstrate that team semantics offers interesting new possibilities for descriptive complexity theory. In order to properly understand the connection between team semantics and descriptive complexity, we introduce an extension ...
متن کاملTeaching-Learning approach in complexity paradigm
"Teaching-Learning Approach" is a model of interaction between teachers and students in an educational environment and one of the main components of the educational system. This model can be organized and designed on the basis of various opinions and ideas, including philosophical or scientific theories. This research aims to design and explain teaching-learning approach based on the complexity...
متن کاملInvestigating Logics for Feasible Computation
The most celebrated open problem in theoretical computer science is, undoubtedly, the problem of whether P = NP. This is actually one instance of the many unresolved questions in the area of computational complexity. Many different classes of decision problems have been defined in terms of the resources needed to recognize them on various models of computation, such as deterministic or non-dete...
متن کاملDescriptive Complexity of #AC0 Functions
We introduce a new framework for a descriptive complexity approach to arithmetic computations. We define a hierarchy of classes based on the idea of counting assignments to free function variables in first-order formulae. We completely determine the inclusion structure and show that #P and #AC0 appear as classes of this hierarchy. In this way, we unconditionally place #AC0 properly in a strict ...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کامل