Skip to main content

check_reachability_from_3sat

problemreductions::rules::analysis

Function check_reachability_from_3sat 

Source 
pub fn check_reachability_from_3sat(
    graph: &ReductionGraph,
) -> ReachabilityReport
Expand description

Check which problems are reachable from 3-SAT (KSatisfiability) via directed reduction paths. Problems without such a path are classified as P-time, intermediate, orphan, or missing a proof chain.