IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 9 of 9  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP, IPSJ-AL 2024-05-09
11:05		 Kyoto Kyoto University (Rakuyu-kaikan) Exact Algorithms for Uniquifying Minimum Vertex Covers under Pre-assignment Models
Takashi Horiyama, Yasuaki Kobayashi (Hokkaido Univ.), Hirotaka Ono (Nagoya Univ.), Kazuhisa Seto, Ryu Suzuki (Hokkaido Univ.) 		 [more]
COMP 2022-12-06
16:05		 Ehime Ehime Univ. Media Hall The Computational Complexity of Majority Function : A Survey
Kazuhisa Seto (Hokkaido Univ.) COMP2022-30		  [more] COMP2022-30
p.48
COMP 2022-12-06
16:55		 Ehime Ehime Univ. Media Hall Isomorphism Elimination by Repetitive Representative-Extraction with Fragments of Automorphisms
Kouhei Takahashi, Kazuhisa Seto, Takashi Horiyama (Hokkaido Univ.) COMP2022-32		  [more] COMP2022-32
pp.51-58
COMP 2022-10-26
11:15		 Fukuoka Kyusyu Univ. Nishijin Plaza A Moderately Exponential Time Satisfiability Algorithm for Linear-Sized Deterministic Width-2 Branching Programs
Tomu Makita (Seikei Univ.), Atsuki Nagao (Ochanomizu Univ.), Tatsuki Okada (Seikei Univ.), Kazuhisa Seto (Hokkaido Univ.), Junichi Teruyama (Univ. of Hyogo) COMP2022-14		  [more] COMP2022-14
pp.2-6
COMP 2017-03-07
15:20		 Aichi Nanzan University Improved Analysis of Greedy Algorithm for Sorting k-Sets in Bins
Kento Shimizu, Tatsuya Mitsuhashi, Kazuhisa Seto (Seikei Univ.) COMP2016-55		 (To be available after the conference date) [more] COMP2016-55
pp.29-32
COMP 2016-10-21
14:00		 Miyagi Tohoku University An Exact Algorithm for the Satisfiability of Depth-2 SYM-AND Circuits.
Kazuhisa Seto (Seikei Univ.), Suguru Tamaki (Kyoto Univ.), Junichi Teruyama (NII) COMP2016-27		 A Boolean function $f: bits{n} to bit$ is {em weighted symmetric}
if there exist a function $g: mathbb{Z} to bit$ and i... [more]		 COMP2016-27
pp.29-34
COMP 2013-12-20
15:30		 Okinawa Okinawa Industry Support Center [Tutorial Lecture] Introduction to Computational Complexity Theory (5): Approaches to P vs. NP via Circuits
Kazuhisa Seto (Seikei Univ.) COMP2013-47		 In this talk, we give a brief introduction to Circuit Complexity and Circuit Satisfiability Problems. At first, we prov... [more] COMP2013-47
p.57
COMP 2013-12-21
11:25		 Okinawa Okinawa Industry Support Center Efficient Algorithms for Sorting $k$-Sets in Bins
Kazuhisa Seto (Seikei Univ.), Junichi Teruyama (NII), Atsuki Nagao (Kyoto Univ.) COMP2013-52		 We give efficient algorithms for Sorting $k$-Sets in Bins.
The Sorting $k$-Sets in Bins problem can be described as f... [more]		 COMP2013-52
pp.81-85
COMP 2012-06-21
13:20		 Hokkaido Hokkaido University A Satisfiability Algorithm and Average-Case Hardness for Formulas over the Full Binary Basis
Kazuhisa Seto, Suguru Tamaki (Kyoto Univ.) COMP2012-17		 We present a moderately exponential time algorithm for the satisfiability of Boolean formulas over the full binary basis... [more] COMP2012-17
pp.41-48
 Results 1 - 9 of 9  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan