↓ Skip to main content
What is this page? Embed badge

Reachability Problems

Overview of attention for book
Cover of 'Reachability Problems'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On Decision Problems for Substitutions in Symbolic Dynamics
  3. Altmetric Badge
    Chapter 2 Games with Full, Longitudinal, and Transverse Observability
  4. Altmetric Badge
    Chapter 3 Reachability Set Generation Using Hybrid Relation Compatible Saturation
  5. Altmetric Badge
    Chapter 4 Case Study: Reachability and Scalability in a Unified Combat-Command-and-Control Model
  6. Altmetric Badge
    Chapter 5 Qualitative Multi-objective Reachability for Ordered Branching MDPs
  7. Altmetric Badge
    Chapter 6 Quantum-over-Classical Advantage in Solving Multiplayer Games
  8. Altmetric Badge
    Chapter 7 Efficient Restrictions of Immediate Observation Petri Nets
  9. Altmetric Badge
    Chapter 8 Binary Expression of Ancestors in the Collatz Graph
  10. Altmetric Badge
    Chapter 9 The Collatz Process Embeds a Base Conversion Algorithm
  11. Altmetric Badge
    Chapter 10 The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets
Attention for Chapter 10: The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets
Altmetric Badge

Citations

dimensions_citation
1 Dimensions
Summary Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
The Complexity of the Label-Splitting-Problem for Flip-Flop-Nets
Chapter number 10
Book title
Reachability Problems
Published by
Springer, Cham, October 2020
DOI 10.1007/978-3-030-61739-4_10
Book ISBNs
978-3-03-061738-7, 978-3-03-061739-4
Authors

Ronny Tredup, Tredup, Ronny

View on publisher site

This page is provided by Altmetric.