Logics capturing relativized complexity classes uniformly
From MaRDI portal
Publication:6064295
DOI10.1007/3-540-60178-3_98OpenAlexW1543130152MaRDI QIDQ6064295
Johann A. Makowsky, Y. B. Pnueli
Publication date: 12 December 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60178-3_98
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Space-bounded hierarchies and probabilistic computations
- Fixed-point extensions of first-order logic
- Relativized alternation and space-bounded computation
- Inductive definitions over finite structures
- Languages that Capture Complexity Classes
- Nondeterministic Space is Closed under Complementation
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question
- Relativization of questions about log space computability
- Expressibility and Parallel Complexity
- Relativized logspace and generalized quantifiers over finite ordered structures
- Parallel computation and the NC hierarchy relativized
- Generalized Quantifiers and Logical Reducibilities
This page was built for publication: Logics capturing relativized complexity classes uniformly
