scientific article; zbMATH DE number 2079359

MaRDI QIDQ4471318zbMATH OpenFDO

Authors Abraham D. Flaxman

Publication date 28 July 2004

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• A spectral technique for random satisfiable 3CNF formulas
• scientific article; zbMATH DE number 5899254
• On the random satisfiable process
• scientific article; zbMATH DE number 437557
• scientific article; zbMATH DE number 1754601

Cited in

(12)

• Optimal testing for planted satisfiability problems
• scientific article; zbMATH DE number 5899254 (Why is no real title available?)
• scientific article; zbMATH DE number 437557 (Why is no real title available?)
• A spectral technique for random satisfiable 3CNF formulas
• A Theoretical Analysis of Search in GSAT
• More on average case vs approximation complexity
• On the security of Goldreich's one-way function
• On the complexity of random satisfiability problems with planted solutions
• AI 2003: Advances in Artificial Intelligence
• Spectral techniques applied to sparse random graphs
• A Spectral Method for MAX2SAT in the Planted Solution Model
• Data reductions, fixed parameter tractability, and random weighted d-CNF satisfiability

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 Q4471318)