Optimal reconfiguration of optimal ladder lotteries

DOI10.1016/J.TCS.2021.01.009zbMATH Open1505.05006OpenAlexW3122272803MaRDI QIDQ2227490FDOQ2227490

Kunihiro Wasa, Katsuhisa Yamanaka, Takashi Horiyama

Publication date: 15 February 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.01.009

zbMATH Keywords

linear-time algorithmreconfiguration problemladder lotteryoptimal ladder lottery

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• New Lower Bounds for the Number of Pseudoline Arrangements
• Symmetric functions, Schubert polynomials and degeneracy loci. Transl. from the French by John R. Swallow
• The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
• On the complexity of reconfiguration problems
• Axioms and hulls
• Coding and counting arrangements of pseudolines
• Efficient enumeration of all ladder lotteries and its application
• Introduction to reconfiguration
• Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas

Cited In (3)

• Optimising SD and LSD in Presence of Non-uniform Probabilities of Revocation
• Reconfiguration and enumeration of optimal cyclic ladder lotteries
• Title not available (Why is that?)

Uses Software

• OEIS

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)