Pages that link to "Item:Q1338212"
From MaRDI portal
The following pages link to Separation of complexity classes in Koiran's weak model (Q1338212):
Displaying 12 items.
- On Ladner's result for a class of real machines with restricted use of constants (Q418114) (← links)
- A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
- On the computation of Boolean functions by analog circuits of bounded fan-in (Q676434) (← links)
- Saturation and stability in the theory of computation over the reals (Q1304539) (← links)
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- Complexity of Bezout's theorem. V: Polynomial time (Q1338222) (← links)
- Generalized Knapsack problems and fixed degree separations (Q1351965) (← links)
- On NP-completeness for linear machines (Q1368835) (← links)
- Real computations with fake numbers (Q1599196) (← links)
- On sparseness, reducibilities, and complexity (Q1779309) (← links)
- On the intractability of Hilbert's Nullstellensatz and an algebraic version of ``\(NP\neq P\)?'' (Q1913573) (← links)
- On Relativizations of the P =? NP Question for Several Structures (Q4918006) (← links)
