scientific article; zbMATH DE number 5999718

DOI10.4230/LIPICS.STACS.2010.2475MaRDI QIDQ3113771zbMATH OpenFDO

Authors Edward A. Hirsch, Dmitry Itsykson

Publication date 23 January 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_db17.html

zbMATH Keywords

optimal algorithmpropositional proof complexity

Mathematics Subject Classification ID

Classical propositional logic (03B05) Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20) Randomized algorithms (68W20)

Recommendations

• On fast heuristic non-deterministic algorithms and short heuristic proofs
• Randomized Algorithms for Semi-Infinite Programming Problems
• scientific article; zbMATH DE number 1304339
• Optimization, randomized approximability, and Boolean constraint satisfaction problems
• Publication:4205241
• On the complexity of semidefinite programs
• Probabilistically checkable proofs and their consequences for approximation algorithms
• On randomized semi-algebraic test complexity
• The randomized complexity of initial value problems

Cited in

(5)

• Optimal heuristic algorithms for the image of an injective function
• On optimal inverters
• scientific article; zbMATH DE number 1342213 (Why is no real title available?)
• Speedup for natural problems and noncomputability
• On optimal heuristic randomized semidecision procedures, with applications to proof complexity and cryptography

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