High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity (Q4640284): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q5361830
 
aliases / en / 0aliases / en / 0
 
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity
description / endescription / en
 
scientific article; zbMATH DE number 6784071
Property / title
 
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity (English)
Property / title: High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1377.94077 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1145/2897518.2897523 / rank
 
Normal rank
Property / published in
 
Property / published in: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing / rank
 
Normal rank
Property / publication date
 
29 September 2017
Timestamp+2017-09-29T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 29 September 2017 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 94B60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6784071 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2107932937 / rank
 
Normal rank

Latest revision as of 10:19, 6 May 2024

scientific article; zbMATH DE number 6784071
  • High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity
Language Label Description Also known as
English
High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity
scientific article; zbMATH DE number 6784071
  • High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity

Statements

High-Rate Locally Correctable and Locally Testable Codes with Sub-Polynomial Query Complexity (English)
0 references
High-rate locally-correctable and locally-testable codes with sub-polynomial query complexity (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
17 May 2018
0 references
29 September 2017
0 references
0 references
0 references
0 references
0 references
0 references
0 references
locally correctable codes
0 references
asymptotically good codes
0 references
locally decodable codes
0 references
locally testable codes
0 references
query complexity
0 references
singleton bound
0 references
Zyablov bound
0 references
0 references
0 references
0 references