Pages that link to "Item:Q920845"
From MaRDI portal
The following pages link to Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845):
Displaying 11 items.
- On the relationship between the discrete and continuous bounding moment problems and their numerical solutions (Q271981) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Improved bounds on the probability of the union of events some of whose intersections are empty (Q1785461) (← links)
- Covering non-uniform hypergraphs (Q1850546) (← links)
- Maximum renamable Horn sub-CNFs (Q1961445) (← links)
- Bounds for the probability of union of events following monotonic distribution (Q2030441) (← links)
- The value of shape constraints in discrete moment problems: a review and extension (Q2095900) (← links)
- Sharp bounds for the probability of union of \(n\) events when \(m\) number of binomial moments are known (Q2303530) (← links)
- New bounds for the probability that at least \(k\)-out-of-\(n\) events occur with unimodal distributions (Q2357784) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
