Model Counting of Monotone Conjunctive Normal Form Formulas with Spectra
From MaRDI portal
Publication:3466783
DOI10.1287/ijoc.2014.0633zbMath1346.68141MaRDI QIDQ3466783
Ofer Strichman, I. B. Gertsbakh, Radislav Vaisman
Publication date: 25 January 2016
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2014.0633
68Q25: Analysis of algorithms and problem complexity
05C80: Random graphs (graph-theoretic aspects)
65C05: Monte Carlo methods
68R05: Combinatorics in computer science
68R10: Graph theory (including graph drawing) in computer science
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Stochastic enumeration method for counting NP-hard problems
- Assessing the reliability and the expected performance of a network under disaster risk
- Efficient Monte Carlo simulation via the generalized splitting method
- The Gibbs cloner for combinatorial optimization, counting and sampling
- Random generation of combinatorial structures from a uniform distribution
- The Complexity of Counting in Sparse, Regular, and Planar Graphs
- A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- On Counting Independent Sets in Sparse Graphs
- Approximate counting by dynamic programming
- Rare Event Simulation using Monte Carlo Methods
- The Complexity of Enumeration and Reliability Problems
- Approximately counting cliques
- Fast simulation of rare events in queueing and reliability models
- The Splitting Method for Decision Making
- Simulation and the Monte Carlo Method
- Theory and Applications of Satisfiability Testing
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
