IEICE Technical Report

Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380

Theoretical Foundations of Computing

Workshop Date : 2010-12-03 / Issue Date : 2010-11-26

COMP2010-39
Hard Functions for Low-degree Polynomials over Prime Fields (Extended Abstract)
Andrej Bogdanov (Chinese Univ. of Hong Kong), Akinori Kawachi, Hidetoki Tanaka (Tokyo Inst. of Tech.)
pp. 1 - 6

COMP2010-40
Energy-Efficient Threshold Circuits Computing Mod Functions
Akira Suzuki, Kei Uchizawa, Xiao Zhou (Tohoku Univ.)
pp. 7 - 13

COMP2010-41
Constant-round reconstruction for rational secret sharing
Akinori Kawachi (Tokyo Inst. of Tech.), Yoshio Okamoto (JAIST), Keisuke Tanaka, Kenji Yasunaga (Tokyo Inst. of Tech.)
pp. 15 - 21

COMP2010-42
On Randomness Leakage in Public-Key Encryption
Hitoshi Namiki, Kenji Yasunaga, Keisuke Tanaka (Tokyo Inst. of Tech.)
pp. 23 - 28

COMP2010-43
An improved result on polynomial-time solvability of the maximum clique problem
Hiroaki Nakanishi, Etsuji Tomita (UEC)
pp. 29 - 36

COMP2010-44
Minimum Cost Partitions of Trees with Supply and Demand
Takehiro Ito, Takuya Hara, Xiao Zhou (Tohoku Univ.), Takao Nishizeki (Kwansei Gakuin Univ.)
pp. 37 - 44

COMP2010-45
Improving the Competitive Ratios of the Seat Reservation Problem
Kazuya Okamoto, Shuichi Miyazaki (Kyoto Univ.)
pp. 45 - 51

COMP2010-46
Maximum Domination Problem
Eiji Miyano (Kyushu Inst. of Tech.), Hirotaka Ono (Kyushu Univ.)
pp. 53 - 60

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