Pages that link to "Item:Q1338219"
From MaRDI portal
The following pages link to On the complexity of quadratic programming in real number models of computation (Q1338219):
Displaying 8 items.
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- On the computational structure of the connected components of a hard problem (Q1607000) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- Generalized finite automata over real and complex numbers (Q2354406) (← links)
- A note on parallel and alternating time (Q2465291) (← links)
- Logics which capture complexity classes over the reals (Q5055931) (← links)
- Complexity aspects of a semi-infinite optimization problem† (Q5449018) (← links)
- On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic (Q5928867) (← links)
