The following pages link to (Q4826736):
Displaying 9 items.
- The real nonnegative inverse eigenvalue problem is NP-hard (Q518113) (← links)
- T for Turing. Machine and, also, uneasiness and desire (Q2304783) (← links)
- A framework for real-valued cipher systems (Q2425831) (← links)
- Exact and Heuristic Algorithms for Semi-Nonnegative Matrix Factorization (Q3195441) (← links)
- Theses for Computation and Recursion on Concrete and Abstract Structures (Q4637218) (← links)
- Feferman on Computability (Q5214780) (← links)
- The dependence of computability on numerical notations (Q6088491) (← links)
- Unrealistic models for realistic computations: how idealisations help represent mathematical structures and found scientific computing (Q6182782) (← links)
- Inverse problems are solvable on real number signal processing hardware (Q6652581) (← links)
