Property testers for dense constraint satisfaction programs on finite domains

DOI10.1002/rsa.10041zbMath1037.68012OpenAlexW2163672273MaRDI QIDQ3150197

Lars Engebretsen, Gunnar Andersson

Publication date: 2002

Published in: Random Structures and Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.10041

zbMATH Keywords

randomized samplingconstant query complexity

Mathematics Subject Classification ID

Theory of programming languages (68N15)

Related Items (2)

Random sampling and approximation of MAX-CSPs ⋮ Testing hypergraph colorability

Cites Work

• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Property testers for dense constraint satisfaction programs on finite domains