Computing the norm ∥A∥∞,1 is NP-hard

By Jiri Rohn. 2000

54 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/6a32dcd6f7c28badec9c1c7fba1fb4b84c3bfffc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

  1. Karel Zimmermann
  2. Jiri Rohn
  3. Josef Nedoma
  4. Miroslav Fiedler
  5. Jaroslav Ramík

Citations in the corpus