( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs.

, , и . ISAAC, том 92 из LIPIcs, стр. 58:1-58:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Junichi Nonaka

Junichi Kumada

Junichi Suzuki

Junichi Yoshida

 

Другие публикации лиц с тем же именем

Minmax Regret 1-Sink Location Problems on Dynamic Flow Path Networks with Parametric Weights., , , , и . WALCOM, том 12635 из Lecture Notes in Computer Science, стр. 52-64. Springer, (2021)A Moderately Exponential Time Algorithm for k-IBDD Satisfiability., , и . WADS, том 9214 из Lecture Notes in Computer Science, стр. 554-565. Springer, (2015)A Satisfiability Algorithm for Deterministic Width-2 Branching Programs., , , , и . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 105-A (9): 1298-1308 (сентября 2022)Faster Algorithms for Evacuation Problems in Networks with the Small Degree Sink and Uniformly Capacitated Edges., , , и . CoRR, (2023)Red-Black Spanners for Mixed-Charging Vehicular Networks., , , , , и . COCOON (1), том 14422 из Lecture Notes in Computer Science, стр. 220-231. Springer, (2023)Faster Algorithms for Evacuation Problems in Networks with a Single Sink of Small Degree and Bounded Capacitated Edges., , , и . COCOA (1), том 14461 из Lecture Notes in Computer Science, стр. 29-42. Springer, (2023)Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs., , и . ISAAC, том 92 из LIPIcs, стр. 58:1-58:10. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Small Complexity Gaps for Comparison-Based Sorting., , и . Adventures Between Lower Bounds and Higher Altitudes, том 11011 из Lecture Notes in Computer Science, стр. 280-296. Springer, (2018)A Satisfiability Algorithm for Depth-2 Circuits with a Symmetric Gate at the Top and AND Gates at the Bottom., , , и . Electron. Colloquium Comput. Complex., (2015)On Computing a Center Persistence Diagram., , , , , , и . FCT, том 14292 из Lecture Notes in Computer Science, стр. 262-275. Springer, (2023)