Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Strong NP-Completeness of a Matrix Similarity Problem."

Valentin E. Brimkov et al. (1996)

> Home

Details and statistics

DOI: 10.1016/0304-3975(96)00103-X

access: open

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/BrimkovCLR96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BrimkovCLR96
Valentin E. Brimkov, Bruno Codenotti, Mauro Leoncini, Giovanni Resta:
Strong NP-Completeness of a Matrix Similarity Problem. Theor. Comput. Sci. 165(2): 483-490 (1996)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.