Configuration graph
From Wikipedia, the free encyclopedia
Configuration graphs are a theoretical tool used in computational complexity theory to prove a relation between graph reachability and complexity classes.[citation needed]
This article needs additional citations for verification. (May 2016) |