( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Polynomial Running Times for Polynomial-Time Oracle Machines.

, и . FSCD, том 84 из LIPIcs, стр. 23:1-23:18. 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.

Hiroki Kawamura

Hiroshi Kawamura

Katsutoshi Kawamura

Eisuke Kawamura

Eiko Kawamura

 

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

Invitation to Real Complexity Theory: Algorithmic Foundations to Reliable Numerics with Bit-Costs., и . CoRR, (2018)Weight Balancing on Boundaries and Skeletons., , , , , , , , , и 3 other автор(ы). SoCG, стр. 436. ACM, (2014)Morpion Solitaire 5D: a new upper bound 121 on the maximum score., , , , и . CCCG, Carleton University, Ottawa, Canada, (2013)Proof of the Density Threshold Conjecture for Pinwheel Scheduling.. STOC, стр. 1816-1819. ACM, (2024)Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete.. CCC, стр. 149-160. IEEE Computer Society, (2009)Computational benefit of smoothness: Parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy., , , и . J. Complex., 31 (5): 689-714 (2015)A lower bound on opaque sets., , , и . CoRR, (2014)Zone diagrams in Euclidean spaces and in other normed spaces., , и . SCG, стр. 216-221. ACM, (2010)Average-Case Polynomial-Time Computability of Hamiltonian Dynamics., , и . MFCS, том 117 из LIPIcs, стр. 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Distance k-Sectors Exist, , , , и . CoRR, (2009)