Folklore confirmed
From MaRDI portal
Flows in graphs (05C21) Theory of compilers and interpreters (68N20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Recommendations
- Flow hypergraph reducibility
- Flow Hypergraph Reducibility
- Solving problems for maximal reducible flowgraphs
- scientific article; zbMATH DE number 1439470
- scientific article; zbMATH DE number 3913694
- scientific article; zbMATH DE number 1231509
- Solving problems for maximal reducible flowgraphs.
- Parallel Algorithms for Reducible Flow Graphs
- scientific article; zbMATH DE number 1008446
- A very simple function that requires exponential size nondeterministic graph-driven read-once branching programs
Cites work
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 615137 (Why is no real title available?)
- scientific article; zbMATH DE number 1942450 (Why is no real title available?)
- scientific article; zbMATH DE number 1948151 (Why is no real title available?)
- scientific article; zbMATH DE number 1953123 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- Regular expression pattern matching for XML
- Types and programing languages
Cited in
(2)
This page was built for publication: Folklore confirmed
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942916)