- Complex systems theory
- >
- Computational complexity theory
- >
- Computational problems
- >
- NL-complete problems

- Mathematical concepts
- >
- Mathematical problems
- >
- Computational problems
- >
- NL-complete problems

- Theory of computation
- >
- Computational complexity theory
- >
- Computational problems
- >
- NL-complete problems

St-connectivity

In computer science, st-connectivity or STCON is a decision problem asking, for vertices s and t in a directed graph, if t is reachable from s. Formally, the decision problem is given by PATH = {⟨D, s

2-satisfiability

In computer science, 2-satisfiability, 2-SAT or just 2SAT is a computational problem of assigning values to variables, each of which has two possible values, in order to satisfy a system of constraint

© 2023 Useful Links.