No label defined (Q5009557)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7378670

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7378670

Statements

scholarly article

0 references

Michael Viderman

0 references

publication date

4 August 2021

0 references

zbMATH Keywords

error-correcting codes

0 references

tensor products

0 references

locally testable codes

0 references

MaRDI profile type

MaRDI publication profile

0 references

Testing Reed–Muller Codes

0 references

Proof verification and the hardness of approximation problems

0 references

Probabilistic checking of proofs

0 references

Efficient probabilistically checkable proofs and applications to approximations

0 references

Free Bits, PCPs, and Nonapproximability---Towards Tight Results

0 references

Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

0 references

Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 14th international workshop, APPROX 2011, and 15th international workshop, RANDOM 2011, Princeton, NJ, USA, August 17--19, 2011. Proceedings

0 references

Sparse affine-invariant linear codes are locally testable

0 references

Robust locally testable codes and products of codes

0 references

Short PCPs with Polylog Query Complexity

0 references

Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21--23, 2009. Proceedings

0 references

0 references

Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, Barcelona, Spain, September 1--3, 2010. Proceedings

0 references

Optimal Testing of Reed-Muller Codes

0 references

Self-testing/correcting with applications to numerical problems

0 references

The PCP theorem by gap amplification

0 references

Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem

0 references

Robust Local Testability of Tensor Products of LDPC Codes

0 references

Interactive proofs and the hardness of approximating cliques

0 references

The tensor product of two good codes is not necessarily robustly testable

0 references

On Proximity-Oblivious Testing

0 references

Locally testable codes and PCPs of almost-linear length

0 references

Succinct Representation of Codes with Applications to Testing

0 references

Some optimal inapproximability results

0 references

New Extension of the Weil Bound for Character Sums with Applications to Coding

0 references

Testing Polynomials over General Fields

0 references

Identifiers

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

10.4230/LIPICS.APPROX-RANDOM.2018.58

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5009557

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5009557&oldid=39510003"