Struct ParameterizedAlgorithmChecker 

pub struct ParameterizedAlgorithmChecker {
    pub param_name: String,
}

Check whether an algorithm runs within FPT time bound f(k) * n^c. Accepts observed runtime, parameter k, input size n, computable f, and constant c.

Fields

param_name: String

Name of the parameter

Implementations

impl ParameterizedAlgorithmChecker

pub fn new(param_name: &str) -> Self

Create a new checker.

pub fn check( &self, observed: u64, k: u64, n: u64, f: impl Fn(u64) -> u64, c: u32, ) -> bool

Return true if observed ≤ f(k) * n^c (i.e., the bound holds).

pub fn check_2k_n(&self, observed: u64, k: u64, n: u64) -> bool

Check the standard 2^k * n bound (common FPT patterns).