Pages that link to "Item:Q1375692"
From MaRDI portal
The following pages link to Inclusion-exclusion: exact and approximate (Q1375692):
Displaying 20 items.
- Two approximate algorithms for model counting (Q507433) (← links)
- A note on approximate inclusion--exclusion (Q674916) (← links)
- Inclusion-exclusion for \(k\)-CNF formulas (Q1014406) (← links)
- Efficient construction of a small hitting set for combinatorial rectangles in high dimension (Q1382408) (← links)
- Reliability evaluation of a multicast over coded packet networks (Q1743495) (← links)
- Measures on Boolean polynomials and their applications in data mining (Q1885816) (← links)
- The hardest halfspace (Q1983325) (← links)
- Using binary patterns for counting falsifying assignments of conjunctive forms (Q2520658) (← links)
- Bounded Indistinguishability and the Complexity of Recovering Secrets (Q2829962) (← links)
- Approximate Model Counting via Extension Rule (Q3452569) (← links)
- Computing the Partition Function of a Polynomial on the Boolean Cube (Q4604373) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$ (Q5117375) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5140844) (← links)
- (Q5158501) (← links)
- Approximating real-rooted and stable polynomials, with combinatorial applications (Q5216314) (← links)
- Simplifying Inclusion–Exclusion Formulas (Q5364235) (← links)
- Approximate Degree, Secret Sharing, and Concentration Phenomena (Q5875531) (← links)
- A construction of combinatorial NLTS (Q5882999) (← links)
