Optimal reconfiguration of optimal ladder lotteries
From MaRDI portal
(Redirected from Publication:2227490)
Recommendations
Cites work
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- Axioms and hulls
- Coding and counting arrangements of pseudolines
- Efficient enumeration of all ladder lotteries and its application
- Introduction to reconfiguration
- New lower bounds for the number of pseudoline arrangements
- On the complexity of reconfiguration problems
- Shortest reconfiguration paths in the solution space of Boolean formulas
- Symmetric functions, Schubert polynomials and degeneracy loci. Transl. from the French by John R. Swallow
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Cited in
(5)- Optimising SD and LSD in Presence of Non-uniform Probabilities of Revocation
- Efficient enumeration of all ladder lotteries and its application
- scientific article; zbMATH DE number 5056644 (Why is no real title available?)
- Reconfiguration and enumeration of optimal cyclic ladder lotteries
- Reconfiguration and enumeration of optimal cyclic ladder lotteries
This page was built for publication: Optimal reconfiguration of optimal ladder lotteries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2227490)