scientific article; zbMATH DE number 1453080
From MaRDI portal
Publication:4955353
zbMath0967.03035MaRDI QIDQ4955353
Publication date: 8 May 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
generalized quantifierdescriptive complexitycomputational complexity theoryLindström quantifiersoracle separationstype 2 operatorscircuits with monoidal gatesleaf language definability
Complexity of computation (including implicit computational complexity) (03D15) Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)
Related Items (12)
Quantum circuits with classical channels and the principle of deferred measurements ⋮ Explicit exponential lower bounds for exact hyperplane covers ⋮ Unnamed Item ⋮ Parallel algorithms for power circuits and the word problem of the Baumslag group ⋮ A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups ⋮ The complexity of circumscriptive inference in Post's lattice ⋮ TC^0 circuits for algorithmic problems in nilpotent groups ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Knapsack in hyperbolic groups ⋮ Approximation in (Poly-) Logarithmic Space ⋮ Relating polynomial time to constant depth
This page was built for publication:
