scientific article; zbMATH DE number 6970796
From MaRDI portal
Publication:4553282
DOI10.23638/LMCS-14(4:5)2018zbMath1402.68092arXiv1806.00256MaRDI QIDQ4553282
Stefan Göller, Moses Ganardi, Markus Lohrey
Publication date: 2 November 2018
Full work available at URL: https://arxiv.org/abs/1806.00256
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fundamentals of parameterized complexity
- CCS expressions, finite state processes, and three problems of equivalence
- Recent developments on graphs of bounded clique-width
- The method of forced enumeration for nondeterministic automata
- On the relative complexity of some languages in \(NC^ 1\)
- Tree-size bounded alternation
- On uniform circuit complexity
- Deciding bisimilarity is P-complete
- Counting quantifiers, successor relations, and logarithmic space
- Completeness results for graph isomorphism.
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- Circuits, matrices, and nonassociative computation
- On uniformity within \(NC^ 1\)
- Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth
- L-Recursion and a new Logic for Logarithmic Space
- The complexity of acyclic conjunctive queries
- Testing Graph Isomorphism in Parallel by Playing a Game
- Three Partition Refinement Algorithms
- Nondeterministic Space is Closed under Complementation
- Two Applications of Inductive Counting for Complementation Problems
- Canonizing Graphs of Bounded Tree Width in Logspace
- Reactive Systems
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
This page was built for publication:
