| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP | 2016-10-21 14:30 |
Miyagi | Tohoku University | On lower bounds for the complexity of the Frobenius problem and its subproblems Shunichi Matsubara (Aoyama Gakuin Univ.)  COMP2016-28 |
In this paper, we lower bounds for the time complexity of the Frobenius problem. Given a set $A$ of coprime positive in... [more] | COMP2016-28 pp.35-37 |
| COMP | 2016-09-06 11:30 |
Toyama | Toyama Prefectural University | On the inapproximability of the Frobenius problem and its relationship with the covering radius problem Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-16 |
Given coprime positive integers $a_1,cdots,a_n$, we call the problem that asks the maximum integer among all positive in... [more] | COMP2016-16 pp.15-16 |
| COMP, IPSJ-AL | 2016-06-24 13:45 |
Ishikawa | On completeness of polynomial-time counting hierarchy under relaxed subtractive reductions Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2016-7 |
The polynomial-time hierarchy was introduced by Meyer and Stockmeyer, which is a hierarchy on decision problems and has ... [more] | COMP2016-7 pp.9-12 |
|
| COMP | 2015-10-02 10:00 |
Tokyo | Upper and lower bounds and time complexities on the Frobenius problem obtained from analysing its additive structure Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2015-22 |
In this work, we investigate upper and lower bounds for the Frobenius problem, using some existing results in additive c... [more] | COMP2015-22 pp.1-5 |
|
| COMP | 2015-04-23 14:55 |
Miyagi | A Note on Approximation Algorithms for the coin-exchange problem of Frobenius Shunichi Matsubara (Aoyamga Gakuin Univ.) |
[more] | ||
| COMP | 2014-12-05 13:55 |
Kumamoto | Sojo University | Carry-free positional notation for nonnegative integer combinations of given sets of positive integers satisfying some conditions Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2014-36 |
In this paper, we investigate conditions to compute nonnegative integer combinations for a given set of positive integer... [more] | COMP2014-36 pp.23-27 |
| COMP | 2014-09-02 15:45 |
Aichi | Toyohashi University of Technology | A Note on the Class of the Computational Comlexity of the Coin-Exchange Problem of Frobenius Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2014-22 |
The coin-exchange problem of Frobenius is a problem that determines whether the Frobenius number for given relatively pr... [more] | COMP2014-22 pp.51-54 |
| COMP | 2013-10-18 16:25 |
Aichi | Nagoya Institute of Technology | An Algorithm for the coin-exchange problem of Frobenius using a parse table Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2013-37 |
The coin-exchange problem of Frobenius is a problem that finds the Frobenius number for relatively prime positive intege... [more] | COMP2013-37 pp.25-28 |
| COMP, IPSJ-AL | 2012-05-14 15:15 |
Ehime | Ehime University | On Context-free Languages That Cannot Be Recognized by Limited Backtrack Top-down Parsers Shunichi Matsubara (Aoyama Gakuin Univ.) COMP2012-11 |
Recently, deterministic parsing with bounded lookahead and limited backtrack top-down parsing have been used for parsing... [more] | COMP2012-11 pp.45-50 |
| COMP | 2011-04-22 09:30 |
Kyoto | Kyoto University | A construction method for non-left-recursive parsing expression grammars Shunichi Matsubara, Shojiro Ogawa, Marin J. Duerst (Aoyama Gakuin Univ.) COMP2011-1 |
Parsing expression grammars (PEGs) have recently been used to describe the syntax of artificial languages such as progra... [more] | COMP2011-1 pp.1-8 |
| COMP | 2009-03-02 14:15 |
Tokyo | Tokyo Institute of Technology | On generalized categorial grammars and tree adjoining grammars Shunichi Matsubara (Univ. of Electro-Comm.) COMP2008-59 |
In this paper, we introduce a formal grammatical model called generalized categorial grammars. This model is used in an ... [more] | COMP2008-59 pp.35-40 |
[Return to Top Page]