scientific article; zbMATH DE number 6970796
From MaRDI portal
Publication:4553282
DOI10.23638/LMCS-14(4:5)2018zbMATH Open1402.68092arXiv1806.00256MaRDI QIDQ4553282FDOQ4553282
Authors: Moses Ganardi, Stefan Göller, Markus Lohrey 
Publication date: 2 November 2018
Full work available at URL: https://arxiv.org/abs/1806.00256
Title of this publication is not available (Why is that?)
Recommendations
- On the parallel complexity of bisimulation on finite systems
- On the computational complexity of bisimulation, redux
- scientific article; zbMATH DE number 7533351
- scientific article; zbMATH DE number 1670835
- On Simulations and Bisimulations of General Flow Systems
- Hybrid Systems: Computation and Control
- An efficient fully symbolic bisimulation algorithm for non-deterministic systems
- scientific article; zbMATH DE number 1759489
- Bisimulation invariance and finite models
- scientific article; zbMATH DE number 1301620
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Fundamentals of parameterized complexity
- On uniform circuit complexity
- Deciding bisimilarity is P-complete
- On uniformity within \(NC^ 1\)
- Recent developments on graphs of bounded clique-width
- Three Partition Refinement Algorithms
- Nondeterministic Space is Closed under Complementation
- Title not available (Why is that?)
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- Reactive Systems
- CCS expressions, finite state processes, and three problems of equivalence
- The complexity of acyclic conjunctive queries
- The method of forced enumeration for nondeterministic automata
- L-recursion and a new logic for logarithmic space
- Completeness results for graph isomorphism.
- Uniform constant-depth threshold circuits for division and iterated multiplication.
- Title not available (Why is that?)
- Counting quantifiers, successor relations, and logarithmic space
- Circuits, matrices, and nonassociative computation
- Algorithmic meta theorems for circuit classes of constant and logarithmic depth
- Title not available (Why is that?)
- Tree-size bounded alternation
- Equivalence and preorder checking for finite-state systems
- Behavioural equivalences on finite-state systems are PTIME-hard
- Two Applications of Inductive Counting for Complementation Problems
- On the relative complexity of some languages in \(NC^ 1\)
- Testing Graph Isomorphism in Parallel by Playing a Game
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Canonizing Graphs of Bounded Tree Width in Logspace
- Title not available (Why is that?)
Cited In (7)
- The Bisimulation Problem for Equational Graphs of Finite Out-Degree
- Bisimulation Finiteness of Pushdown Systems Is Elementary
- On the computational complexity of bisimulation, redux
- Constrained simulations, nested simulation semantics and counting bisimulations
- From bisimulation to simulation: Coarsest partition problems
- Title not available (Why is that?)
- A comparison of succinctly represented finite-state systems
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 Q4553282)
