IEICE Technical Report

Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2025-10-30 / Issue Date : 2025-10-23

COMP2025-8
Using Long Step Length in Steepest Descent Algorithm for M-convex Function Minimization
Taihei Oki (Hokkaido Univ.), Akiyoshi Shioura (Science Tokyo)
pp. 1 - 8

COMP2025-9
QCCC Coin Flipping with Constant Bias Implies One-Way Puzzles
Saku Mizuhara (Kyoto Univ.)
pp. 9 - 15

COMP2025-10
[Invited Talk] Quantum cryptography without one-way functions
Tomoyuki Morimae (Kyoto University)
p. 16

COMP2025-11
On the Hardness of Independent Set Reconfiguration under Token Sliding on Eulerian Bipartite Graphs
Hanxiang Liu, Kunihiro Wasa (Hosei Univ.)
pp. 17 - 23

COMP2025-12
Linear-Space Subquadratic-Time String Alignment Algorithm for Arbitrary Scoring Matrices
Ryosuke Yamano, Tetsuo Shibuya (UTokyo)
pp. 24 - 30

Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.

The Institute of Electronics, Information and Communication Engineers (IEICE), Japan