Is code equivalence easy to decide? (Q4371902): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2156052684 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 20:03, 19 March 2024
scientific article; zbMATH DE number 1106495
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Is code equivalence easy to decide? |
scientific article; zbMATH DE number 1106495 |
Statements
Is code equivalence easy to decide? (English)
0 references
13 April 1998
0 references
equivalent linear codes
0 references
code equivalence
0 references
interactive proofs
0 references
NP-complete
0 references
graph isomorphism problem
0 references
