scientific article; zbMATH DE number 2119722

zbMATH Open1093.68607MaRDI QIDQ4828996FDOQ4828996

Authors: Noga Alon, Asaf Shapira 

Publication date: 29 November 2004

Title of this publication is not available (Why is that?)

Recommendations

• Testing satisfiability
• Property testers for dense constraint satisfaction programs on finite domains
• Testing hypergraph colorability
• scientific article; zbMATH DE number 1754615
• Theory and Applications of Models of Computation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10)

Cited In (6)

• Approximate membership for regular languages modulo the edit distance
• Testing Read-Once Formula Satisfaction
• A proof of Green's conjecture regarding the removal properties of sets of linear equations
• Title not available (Why is that?)
• Testing for edge terms is decidable
• Random sampling and approximation of MAX-CSPs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828996)