Arrow Research search
Back to STOC

STOC 1997

Algorithmic Complexity in Coding Theory and the Minimum Distance Problem

Invited Paper Invited Session I Algorithms and Complexity ยท Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
879736045678224558