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 - 6 of 6  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2013-06-24
13:20		 Nara Nara Women's University [Tutorial Lecture] Introduction to Computational Complexity Theory (3): Mathematical Programming Approaches to the Limitations of Computation
Kenya Ueno (Kyoto Univ.) COMP2013-22		 This presentation corresponds to the third tutorial of the ELC (Exploring the Limits of Computation) project supported b... [more] COMP2013-22
p.21
COMP 2012-06-21
13:45		 Hokkaido Hokkaido University Candidate Boolean Functions towards Super-Quadratic Formula Size
Kenya Ueno (Kyoto Univ.) COMP2012-18		 In this paper, we explore possibilities and difficulties to prove super-quadratic formula size lower bounds from the fol... [more] COMP2012-18
pp.49-55
COMP 2009-10-16
16:00		 Miyagi Tohoku University Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds
Kenya Ueno (Univ. of Tokyo) COMP2009-38		 Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectang... [more] COMP2009-38
pp.41-48
COMP 2008-12-03
14:35		 Gunma Gunma Univ. Improved Formula Size Lower Bounds for Monotone Self-Dual Boolean Functions
Kenya Ueno (Univ. of Tokyo) COMP2008-51		 We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduc... [more] COMP2008-51
pp.33-40
COMP 2006-04-26
09:55		 Kyoto Kyoto University Reducing L versus P to Reversal versus Access
Kenya Ueno (Univ. of Tokyo) 		Reversal complexity has been studied as a fundamental computational resource along with time and space. In this study, w... [more] COMP2006-2
pp.9-16
COMP 2005-04-18
13:15		 Hyogo Kwansei Gakuin Univ. On time and space complexity of functions
Kenya Ueno (Univ. of Tokyo) 		Similar to the computable function class, it is known that many function complexity classes like $FP$ and $FPSPACE$
can... [more]		 COMP2005-4
pp.25-30
 Results 1 - 6 of 6  /   
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