scientific article
From MaRDI portal
Publication:3686042
zbMATH Open0569.68041MaRDI QIDQ3686042
Author name not available (Why is that?)
Publication date: 1985
Title of this publication is not available (Why is that?)
Related Items (2)
Output sensitive algorithms for approximate incidences and their applications ⋮ Unimodality, independence lead to NP-hardness of interval probability problems
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Probabilistic complexity analysis for linear problems in bounded domains 👍 👎
- Probabilistic bounds and algorithms for the maximum satisfiability problem 👍 👎
- On some conditioning results in the probabilistic analysis of algorithms 👍 👎
- On the Complexity of Computational Problems Regarding Distributions 👍 👎
- Random Instances of Problems in NP – Algorithms and Statistical Physics 👍 👎
- Theory and Applications of Satisfiability Testing 👍 👎
- The probabilistic analysis of a greedy satisfiability algorithm 👍 👎
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 Q3686042)
