Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree
DOI10.1016/0020-0190(90)90093-DzbMATH Open0695.68042OpenAlexW2047540023MaRDI QIDQ910223FDOQ910223
Authors: Christoph Meinel 
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90093-d
Recommendations
- scientific article; zbMATH DE number 8782
- Logical complexity of graphs: a survey
- scientific article; zbMATH DE number 4001498
- Capacity complexity of the accessibility problem for frontally bounded digraphs
- Expressiveness and complexity of graph logic
- scientific article; zbMATH DE number 1351076
- Parameterized complexity of graph constraint logic
- A complexity problem for Borel graphs
- The critical complexity of graph properties
- scientific article; zbMATH DE number 219271
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Automata and formal grammars in connection with logical questions (03D05)
Cites Work
- Relationships between nondeterministic and deterministic tape complexities
- Symmetric space-bounded computation
- A complexity theory based on Boolean algebra
- Modified branching programs and their computational power
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910223)
