Pages that link to "Item:Q1243130"
From MaRDI portal
The following pages link to NP-complete decision problems for binary quadratics (Q1243130):
Displayed 16 items.
- \(\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)
- 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)
- Seventeen lines and one-hundred-and-one points (Q1885913) (← links)
- Elimination of quantifiers from arithmetical formulas defining recursively enumerable sets (Q1887829) (← links)
- Diophantine complexity (Q2276953) (← 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)