( en | de | ru )

 

Disambiguation of "Makino, Kazuhisa"

Author of the publication

copydeleteadd this publication to your clipboard
On Randomized Fictitious Play for Approximating Saddle Points over Convex Sets.

, , , and . COCOON, volume 7936 of Lecture Notes in Computer Science, page 65-76. Springer, (2013)

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. You can also use the button next to the name to display some publications already assigned to the person.

Kazuhisa Kakurai

 

Other publications of authors with the same name

Deterministic Random Walks on Finite Graphs., , and . ANALCO, page 16-25. SIAM, (2012)Approximating minimum representations of key Horn functions., , , , and . CoRR, (2018)Fully Consistent Extensions of Partially Defined Boolean Functions with Missing Bits., , and . IFIP TCS, volume 1872 of Lecture Notes in Computer Science, page 257-272. Springer, (2000)Disjunctions of Horn Theories and Their Cores., , and . ISAAC, volume 1533 of Lecture Notes in Computer Science, page 49-58. Springer, (1998)On Disguised Double Horn Functions and Extensions., , and . STACS, volume 1373 of Lecture Notes in Computer Science, page 50-60. Springer, (1998)On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets., , , and . STACS, volume 2285 of Lecture Notes in Computer Science, page 133-141. Springer, (2002)Boolean Analysis of Incomplete Examples., , and . SWAT, volume 1097 of Lecture Notes in Computer Science, page 440-451. Springer, (1996)Randomized Algorithms for Removable Online Knapsack Problems., , and . FAW-AAIM, volume 7924 of Lecture Notes in Computer Science, page 60-71. Springer, (2013)Parameterized Complexity of Sparse Linear Complementarity Problems., , and . IPEC, volume 43 of LIPIcs, page 355-364. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2015)Generating clause sequences of a CNF formula., , , , , and . CoRR, (2020)