| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
Technical Committee on Theoretical Foundations of Computing (COMP) (Searched in: 2010)
Search Results: Keywords 'from:2010-12-03 to:2010-12-03'
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2010-12-03 10:30 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | 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.)  COMP2010-39 |
In this paper, we present a new hardness amplification for low-degree polynomials over prime fields, namely, we prove th... [more] | COMP2010-39 pp.1-6 |
| COMP | 2010-12-03 11:05 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | Energy-Efficient Threshold Circuits Computing Mod Functions Akira Suzuki, Kei Uchizawa, Xiao Zhou (Tohoku Univ.) COMP2010-40 |
We prove that the modulus function MOD$_m$ of $n$ variables can be computed by a threshold circuit $C$ of energy $e$ a... [more] |
COMP2010-40 pp.7-13 |
| COMP | 2010-12-03 13:00 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | Constant-round reconstruction for rational secret sharing Akinori Kawachi (Tokyo Inst. of Tech.), Yoshio Okamoto (JAIST), Keisuke Tanaka, Kenji Yasunaga (Tokyo Inst. of Tech.) COMP2010-41 |
[more] | COMP2010-41 pp.15-21 |
| COMP | 2010-12-03 13:35 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | On Randomness Leakage in Public-Key Encryption Hitoshi Namiki, Kenji Yasunaga, Keisuke Tanaka (Tokyo Inst. of Tech.) COMP2010-42 |
We consider the problem of constructing public-key encryption schemes that are resilient to leaking the randomness used ... [more] | COMP2010-42 pp.23-28 |
| COMP | 2010-12-03 14:30 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | An improved result on polynomial-time solvability of the maximum clique problem Hiroaki Nakanishi, Etsuji Tomita (UEC) COMP2010-43 |
This report presents an improved result for polynomial-time solvability of the maximum clique problem which is a typical... [more] | COMP2010-43 pp.29-36 |
| COMP | 2010-12-03 15:05 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | Minimum Cost Partitions of Trees with Supply and Demand Takehiro Ito, Takuya Hara, Xiao Zhou (Tohoku Univ.), Takao Nishizeki (Kwansei Gakuin Univ.) COMP2010-44 |
[more] | COMP2010-44 pp.37-44 |
| COMP | 2010-12-03 16:00 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | Improving the Competitive Ratios of the Seat Reservation Problem Kazuya Okamoto, Shuichi Miyazaki (Kyoto Univ.) COMP2010-45 |
In the seat reservation problem, there are $k$ stations, $s_{1}$ through $s_{k}$, and one train with $n$ seats departin... [more] |
COMP2010-45 pp.45-51 |
| COMP | 2010-12-03 16:35 |
Fukuoka | Kyutech Plaza, Kyushu Institute of Technology | Maximum Domination Problem Eiji Miyano (Kyushu Inst. of Tech.), Hirotaka Ono (Kyushu Univ.) COMP2010-46 |
We consider new variants of the vertex/edge domination problems on graphs. A vertex is said to {\em dominate} itself an... [more] |
COMP2010-46 pp.53-60 |
[Return to Top Page]