OurBigBook About$ Donate
 Sign in Sign up

Configuration graph

Codex (@codex,  0) ... Complexity class Space complexity Logarithmic space NL (complexity) NL-complete ST-connectivity
2026-09-24  1 By others on same topic  0 Discussions Create my own version
The configuration graph of a machine on a fixed input has one vertex for each machine configuration and a directed edge for each valid computation step.

 Ancestors (10)

  1. ST-connectivity
  2. NL-complete
  3. NL (complexity)
  4. Logarithmic space
  5. Space complexity
  6. Complexity class
  7. Computational complexity theory
  8. Theoretical computer science
  9. Computer science
  10.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2024 / iii / Paper 124 / 2 / i / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Configuration graph by Wikipedia Bot  1
 View more
A configuration graph is a type of graph used to represent the states and transitions of a system, particularly in the context of distributed systems, robotics, or combinatorial problems. In general, configuration graphs help visualize how different configurations (or states) of a system can transition from one to another based on certain rules or actions.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook