Struct Factoring 

pub struct Factoring { /* private fields */ }

The Integer Factoring problem.

Given a number to factor, find two integers that multiply to give the target number. Variables represent the bits of the two factors.

Example

use problemreductions::models::specialized::Factoring;
use problemreductions::{Problem, Solver, BruteForce};

// Factor 6 with 2-bit factors (allowing factors 0-3)
let problem = Factoring::new(2, 2, 6);

let solver = BruteForce::new();
let solutions = solver.find_best(&problem);

// Should find: 2*3=6 or 3*2=6
for sol in &solutions {
    let (a, b) = problem.read_factors(sol);
    assert_eq!(a * b, 6);
}

Implementations

impl Factoring

pub fn new(m: usize, n: usize, target: u64) -> Self

Create a new Factoring problem.

Arguments

• m - Number of bits for the first factor
• n - Number of bits for the second factor
• target - The number to factor

pub fn m(&self) -> usize

Get the number of bits for the first factor.

pub fn n(&self) -> usize

Get the number of bits for the second factor.

pub fn target(&self) -> u64

Get the target number to factor.

pub fn read_factors(&self, config: &[usize]) -> (u64, u64)

Read the two factors from a configuration.

The first m bits represent the first factor, the next n bits represent the second factor.

pub fn is_valid_factorization(&self, config: &[usize]) -> bool

Check if the configuration is a valid factorization.

Trait Implementations

impl Clone for Factoring

fn clone(&self) -> Factoring

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for Factoring

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for Factoring

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for Factoring

const NAME: &'static str = "Factoring"

Base name of this problem type (e.g., “IndependentSet”).

type GraphType = SimpleGraph

The graph type this problem operates on.

type Weight = i32

The weight type for this problem.

type Size = i32

The type used for objective/size values.

fn num_variables(&self) -> usize

Returns the number of variables in the problem.

fn num_flavors(&self) -> usize

Returns the number of possible values (flavors) for each variable. For binary problems, this is 2.

fn problem_size(&self) -> ProblemSize

Returns metadata about the problem size.

fn energy_mode(&self) -> EnergyMode

Returns whether larger or smaller objective values are better.

fn solution_size(&self, config: &[usize]) -> SolutionSize<Self::Size>

Evaluate the solution size for a given configuration.

fn variables(&self) -> Range<usize>

Returns the range of variable indices.

fn flavors(&self) -> Vec<usize>

Returns the possible flavors as a vector.

fn is_valid_config(&self, config: &[usize]) -> bool

Check if a configuration is valid for this problem.

fn solution_size_multiple( &self, configs: &[Vec<usize>], ) -> Vec<SolutionSize<Self::Size>>

Evaluate multiple configurations at once (batch evaluation).

impl ReduceTo<CircuitSAT> for Factoring

type Result = ReductionFactoringToCircuit

The reduction result type.

fn reduce_to(&self) -> Self::Result

Reduce this problem to the target problem type.

impl Serialize for Factoring

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.