Struct QuadraticDiophantineEquations 

pub struct QuadraticDiophantineEquations { /* private fields */ }

Quadratic Diophantine Equations problem.

Given positive integers a, b, and c, determine whether there exist positive integers x, y such that a x^2 + b y = c.

The configuration encodes x in little-endian binary: config[i] in {0,1} is the coefficient of 2^i.

Implementations

impl QuadraticDiophantineEquations

pub fn try_new<A, B, C>(a: A, b: B, c: C) -> Result<Self, String>

where A: ToBigUint, B: ToBigUint, C: ToBigUint,

Create a new QuadraticDiophantineEquations instance, returning an error instead of panicking when inputs are invalid.

pub fn new<A, B, C>(a: A, b: B, c: C) -> Self

where A: ToBigUint, B: ToBigUint, C: ToBigUint,

Create a new QuadraticDiophantineEquations instance.

Panics

Panics if any of a, b, c is zero.

pub fn a(&self) -> &BigUint

Get the coefficient a (coefficient of x^2).

pub fn b(&self) -> &BigUint

Get the coefficient b (coefficient of y).

pub fn c(&self) -> &BigUint

Get the right-hand side constant c.

pub fn bit_length_a(&self) -> usize

Number of bits needed to encode the coefficient a.

pub fn bit_length_b(&self) -> usize

Number of bits needed to encode the coefficient b.

pub fn bit_length_c(&self) -> usize

Number of bits needed to encode the constant c.

pub fn encode_witness(&self, x: &BigUint) -> Option<Vec<usize>>

Encode a candidate witness integer x as a little-endian binary configuration.

pub fn decode_witness(&self, config: &[usize]) -> Option<BigUint>

Decode a little-endian binary configuration into its candidate witness x.

pub fn check_x(&self, x: &BigUint) -> Option<BigUint>

Check whether a given x yields a valid positive integer y.

Returns Some(y) if y is a positive integer, None otherwise.

Trait Implementations

impl Clone for QuadraticDiophantineEquations

fn clone(&self) -> QuadraticDiophantineEquations

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for QuadraticDiophantineEquations

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for QuadraticDiophantineEquations

fn deserialize<D>(deserializer: D) -> Result<Self, D::Error>

where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Problem for QuadraticDiophantineEquations

const NAME: &'static str = "QuadraticDiophantineEquations"

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

type Value = Or

The evaluation value type.

fn variant() -> Vec<(&'static str, &'static str)>

Returns variant attributes derived from type parameters.

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

Configuration space dimensions. Each entry is the cardinality of that variable.

fn evaluate(&self, config: &[usize]) -> Or

Evaluate the problem on a configuration.

fn num_variables(&self) -> usize

Number of variables (derived from dims).

fn problem_type() -> ProblemType

Look up this problem’s catalog entry.

impl ReduceTo<QuadraticDiophantineEquations> for KSatisfiability<K3>

type Result = Reduction3SATToQuadraticDiophantineEquations

The reduction result type.

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

Reduce this problem to the target problem type.

impl Serialize for QuadraticDiophantineEquations

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl DeclaredVariant for QuadraticDiophantineEquations