The following pages link to (Q4247261):
Displaying 24 items.
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- Book review of: E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema, S. Weinstein, Finite model theory and its applications (Q458460) (← links)
- Hardness of equivalence checking for composed finite-state systems (Q1015390) (← links)
- Voting by eliminating quantifiers (Q1037605) (← links)
- An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
- Annotation theories over finite graphs (Q2269516) (← links)
- Knowledge representation analysis of graph mining (Q2317967) (← links)
- On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
- Generic incremental algorithms for local search (Q2385177) (← links)
- Epsilon-logic is more expressive than first-order logic over finite structures (Q2710605) (← links)
- Number of variables is equivalent to space (Q2758055) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- A Logical Characterization of Small 2NFAs (Q2830217) (← links)
- The probability nesting game (Q2842598) (← links)
- Formal descriptions of code properties: decidability, complexity, implementation (Q2909182) (← links)
- An Extension of the Ehrenfeucht-Fraïssé Game for First Order Logics Augmented with Lindström Quantifiers (Q2947176) (← links)
- DESCRIPTIVE COMPLEXITY OF FINITE ABELIAN GROUPS (Q3067786) (← links)
- Parameterized Complexity Classes under Logical Reductions (Q3182930) (← links)
- SO F : A Semantic Restriction over Second-Order Logic and Its Polynomial-Time Hierarchy (Q3224003) (← links)
- COMPLEXITY, INFORMATION, ENERGY (Q3526535) (← links)
- Approximate databases: a support tool for approximate reasoning (Q3647257) (← links)
- 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 (Q4432544) (← links)
- Characterizing polynomial Ramsey quantifiers (Q5377702) (← links)
- Capturing the polynomial hierarchy by second-order revised Krom logic (Q6135775) (← links)
