scientific article; zbMATH DE number 3562523
From MaRDI portal
Publication:4134974
Cited in
(9)- Expressivity and Complexity of Dependence Logic
- Finite-model theory -- A personal perspective
- Proving that \(\mathrm{prBPP}=\mathrm{prP}\) is as hard as proving that ``almost NP is not contained in P/poly
- A logical approach to locality in pictures languages
- Complexity barriers as independence
- On the extension of Gladkij's theorem and the hierarchies of languages
- On the dynamics between gravity and entanglement
- On two-way multihead automata
- Translational lemmas, polynomial time, and \((\log n)^j\)-space
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4134974)
