论文信息 - Optimal reconfiguration of optimal ladder lotteries - 字舞流文

Optimal reconfiguration of optimal ladder lotteries

Takashi Horiyama | Kunihiro Wasa | Katsuhisa Yamanaka

[1] Naomi Nishimura,et al. On the Parameterized Complexity of Reconfiguration Problems , 2013, Algorithmica.

[2] Donald E. Knuth,et al. Axioms and Hulls , 1992, Lecture Notes in Computer Science.

[3] Naomi Nishimura,et al. Introduction to Reconfiguration , 2018, Algorithms.

[4] Adrian Dumitrescu,et al. New Lower Bounds for the Number of Pseudoline Arrangements , 2018, SODA.

[5] Naomi Nishimura,et al. Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas , 2017, SIAM J. Discret. Math..

[6] Takehiro Ito,et al. On the complexity of reconfiguration problems , 2011, Theor. Comput. Sci..

[7] Shin-Ichi Nakano,et al. Efficient enumeration of all ladder lotteries and its application , 2010, Theor. Comput. Sci..

[8] Christos H. Papadimitriou,et al. The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies , 2006, SIAM J. Comput..

[9] Stefan Felsner,et al. Coding and Counting Arrangements of Pseudolines , 2011, Discret. Comput. Geom..