Pages that link to "Item:Q1243130"

The following pages link to NP-complete decision problems for binary quadratics (Q1243130):

Displaying 30 items.

• A computational DNA solution approach for the quadratic Diophantine equation (Q275220) (← links)
• Division by zero (Q335000) (← links)
• \(\text{NP}\not={co}\)-NP and models of arithmetic (Q672454) (← links)
• P, NP, Co-NP and weak systems of arithmetic (Q672742) (← links)
• A normal form for arithmetical representation of \({\mathcal N}{\mathcal P}\)-sets (Q790804) (← links)
• An augmented filled function for global nonlinear integer optimization (Q828743) (← links)
• A note on quadratic residuosity and UP (Q834917) (← links)
• Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
• On the complexity of simple arithmetic expressions (Q1162150) (← links)
• Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games (Q1196208) (← links)
• Sentences over integral domains and their computational complexities (Q1286369) (← links)
• A direct method for simulating partial recursive functions by Diophantine equations (Q1326783) (← links)
• Mathematical problems for the next century (Q1582494) (← links)
• A transfer method from bounded existential Diophantine equations to Tarski algebra formulas (Q1686076) (← links)
• Seventeen lines and one-hundred-and-one points (Q1885913) (← links)
• Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets (Q1887829) (← links)
• Complexity yardsticks for \(f\)-vectors of polytopes and spheres (Q2197688) (← links)
• On the number of integer points in translated and expanded polyhedra (Q2227240) (← links)
• Diophantine complexity (Q2276953) (← links)
• COMPLEXITY OF SHORT GENERATING FUNCTIONS (Q3119462) (← links)
• Complexity of Subcases of Presburger Arithmetic (Q3340842) (← links)
• A NEW QUANTUM ALGORITHM FOR SOLVING THE MINIMUM SEARCHING PROBLEM (Q3534103) (← links)
• Identification and signatures based on NP-hard problems of indefinite quadratic forms (Q3612243) (← links)
• Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
• Signatures Through Approximate Representations by Quadratic Forms (Q5019323) (← links)
• Short Presburger Arithmetic Is Hard (Q5073520) (← links)
• (Q5155665) (← links)
• The double exponential runtime is tight for 2-stage stochastic ILPs (Q5918430) (← links)
• The double exponential runtime is tight for 2-stage stochastic ILPs (Q5925653) (← links)
• Decision Questions for Probabilistic Automata on Small Alphabets (Q6137871) (← links)