IEICE Trans

Keyword : computational complexity

Stronger Hardness Results on the Computational Complexity of Picross 3D Kei KIMURA
Publication: Publication Date: 2020/04/01 Vol. E103-A No. 4 ; pp. 668-676 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: computational complexity, puzzle, Picross 3D, NP-completeness, #P-completeness, Σ^P₂-completeness,
	Summary \| Full Text:PDF(688.3KB)

Generalized Register Context-Free Grammars Ryoma SENDA Yoshiaki TAKATA Hiroyuki SEKI
Publication: Publication Date: 2020/03/01 Vol. E103-D No. 3 ; pp. 540-548 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science — Frontiers of Theory of Computation and Algorithm —) Category: Keyword: register context-free grammar, register type, computational complexity, data word, data language,
	Summary \| Full Text:PDF(343.5KB)

NP-Completeness of Fill-a-Pix and Σ^P₂-Completeness of Its Fewest Clues Problem Yuta HIGUCHI Kei KIMURA
Publication: Publication Date: 2019/11/01 Vol. E102-A No. 11 ; pp. 1490-1496 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: computational complexity, pencil-and-paper puzzle, Fill-a-Pix, NP-completeness, Σ^P₂-completeness,
	Summary \| Full Text:PDF(1.2MB)

Low-Complexity Blind Spectrum Sensing in Alpha-Stable Distributed Noise Based on a Gaussian Function Jinjun LUO Shilian WANG Eryang ZHANG
Publication: Publication Date: 2019/07/01 Vol. E102-B No. 7 ; pp. 1334-1344 Type of Manuscript: PAPER Category: Antennas and Propagation Keyword: spectrum sensing, impulsive noise, alpha stable distribution, Gaussian function, computational complexity,
	Summary \| Full Text:PDF(1.2MB)

On-Off Power Control with Low Complexity in D2D Underlaid Cellular Networks Tae-Won BAN Bang Chul JUNG
Publication: Publication Date: 2018/09/01 Vol. E101-B No. 9 ; pp. 1961-1966 Type of Manuscript: PAPER Category: Network Keyword: D2D communications, D2D underlaid cellular network, on-off power control, interference, computational complexity,
	Summary \| Full Text:PDF(1.1MB)

Computational Complexity and Polynomial Time Procedure of Response Property Problem in Workflow Nets Muhammad Syafiq BIN AB MALEK Mohd Anuaruddin BIN AHMADON Shingo YAMAGUCHI
Publication: Publication Date: 2018/06/01 Vol. E101-D No. 6 ; pp. 1503-1510 Type of Manuscript: Special Section PAPER (Special Section on Formal Approaches) Category: Formal Approaches Keyword: the response property, Petri net, process tree, computational complexity, polynomial time algorithm,
	Summary \| Full Text:PDF(609.5KB)

A Computationally Efficient Leaky and Regularized RLS Filter for Its Short Length Eisuke HORITA
Publication: Publication Date: 2017/12/01 Vol. E100-A No. 12 ; pp. 3045-3048 Type of Manuscript: LETTER Category: Digital Signal Processing Keyword: adaptive filter, RLS, computational complexity, regularization, Tikhonov,
	Summary \| Full Text:PDF(220.8KB)

A Low Computational Complexity Algorithm for Compressive Wideband Spectrum Sensing Shiyu REN Zhimin ZENG Caili GUO Xuekang SUN Kun SU
Publication: Publication Date: 2017/01/01 Vol. E100-A No. 1 ; pp. 294-300 Type of Manuscript: LETTER Category: Digital Signal Processing Keyword: compressive wideband spectrum sensing, aliased spectrum, coarse sensing, fine sensing, computational complexity,
	Summary \| Full Text:PDF(350.6KB)

On the Computational Complexity of the Linear Solvability of Information Flow Problems with Hierarchy Constraint Yuki TAKEDA Yuichi KAJI Minoru ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2016/12/01 Vol. E99-A No. 12 ; pp. 2211-2217 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Networks and Network Coding Keyword: information flow problem, network coding, computational complexity, hierarchy constraint, mesh network,
	Summary \| Full Text:PDF(636.3KB)

Comparing Performance of Hierarchical Identity-Based Signature Schemes Peixin CHEN Yilun WU Jinshu SU Xiaofeng WANG
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2016/12/01 Vol. E99-D No. 12 ; pp. 3181-3184 Type of Manuscript: LETTER Category: Information Network Keyword: identity-based signature, computational complexity, paring based cryptography,
	Summary \| Full Text:PDF(248.4KB)

Computational Complexity of Predicting Periodicity in the Models of Lorentz Lattice Gas Cellular Automata Takeo HAGIWARA Tatsuie TSUKIJI Zhi-Zhong CHEN
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2016/06/01 Vol. E99-A No. 6 ; pp. 1034-1049 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: cellular automata, computational complexity, Lorentz lattice gas, Langton's ant, PSPACE-complete,
	Summary \| Full Text:PDF(2.1MB)

Fast Mode Decision Technique for HEVC Intra Prediction Based on Reliability Metric for Motion Vectors Chihiro TSUTAKE Yutaka NAKANO Toshiyuki YOSHIDA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2016/04/01 Vol. E99-D No. 4 ; pp. 1193-1201 Type of Manuscript: PAPER Category: Image Processing and Video Processing Keyword: H.265/HEVC, intra prediction, mode decision, reliability metric, coding efficiency, computational complexity,
	Summary \| Full Text:PDF(764KB)

A Novel RZF Precoding Method Based on Matrix Decomposition: Reducing Complexity in Massive MIMO Systems Qian DENG Li GUO Jiaru LIN Zhihui LIU
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2016/02/01 Vol. E99-B No. 2 ; pp. 439-446 Type of Manuscript: PAPER Category: Antennas and Propagation Keyword: massive MIMO, matrix decomposition, RZF precoding, computational complexity, power allocation,
	Summary \| Full Text:PDF(1.3MB)

State Number Calculation Problem of Workflow Nets Mohd Anuaruddin BIN AHMADON Shingo YAMAGUCHI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2015/06/01 Vol. E98-D No. 6 ; pp. 1128-1136 Type of Manuscript: Special Section PAPER (Special Section on Formal Approach) Category: Petri net Keyword: Petri net, state number calculation problem, process tree, solvability, computational complexity, model checking,
	Summary \| Full Text:PDF(1.1MB)

Computational Complexity of Generalized Golf Solitaire Chuzo IWAMOTO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2015/03/01 Vol. E98-D No. 3 ; pp. 541-544 Type of Manuscript: Special Section LETTER (Special Section on Foundations of Computer Science---New Spirits in Theory of Computation and Algorithm---) Category: Keyword: computational complexity, NP-completeness, puzzle,
	Summary \| Full Text:PDF(372.2KB)

Candidate Boolean Functions towards Super-Quadratic Formula Size Kenya UENO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2015/03/01 Vol. E98-D No. 3 ; pp. 524-531 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science---New Spirits in Theory of Computation and Algorithm---) Category: Keyword: Boolean function, computational complexity, formula complexity,
	Summary \| Full Text:PDF(206.1KB)

Computational Complexity of Generalized Forty Thieves Chuzo IWAMOTO Yuta MATSUI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2015/02/01 Vol. E98-D No. 2 ; pp. 429-432 Type of Manuscript: LETTER Category: Fundamentals of Information Systems Keyword: computational complexity, NP-completeness, puzzle,
	Summary \| Full Text:PDF(385KB)

#P-hardness of Computing High Order Derivative and Its Logarithm Ei ANDO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2014/06/01 Vol. E97-A No. 6 ; pp. 1382-1384 Type of Manuscript: Special Section LETTER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: computable analysis, computational complexity, #P-hardness, SUBSET SUM,
	Summary \| Full Text:PDF(79.4KB)

A Note on Cooperating Systems of One-Way Alternating Finite Automata with Only Universal States Tatsuya FUJIMOTO Tsunehiro YOSHINAGA Makoto SAKAMOTO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2014/06/01 Vol. E97-A No. 6 ; pp. 1375-1377 Type of Manuscript: Special Section LETTER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: cooperating system of one-way finite automata, alternating finite automata, universal states, computational complexity,
	Summary \| Full Text:PDF(79.7KB)

Generalized Pyramid is NP-Complete Chuzo IWAMOTO Yuta MATSUI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2013/11/01 Vol. E96-D No. 11 ; pp. 2462-2465 Type of Manuscript: LETTER Category: Fundamentals of Information Systems Keyword: NP-complete, computational complexity, one-player game, pyramid,
	Summary \| Full Text:PDF(371.7KB)

Generalized Chat Noir is PSPACE-Complete Chuzo IWAMOTO Yuta MUKAI Yuichi SUMIDA Kenichi MORITA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2013/03/01 Vol. E96-D No. 3 ; pp. 502-505 Type of Manuscript: Special Section LETTER (Special Section on Foundations of Computer Science — New Trends in Algorithms and Theory of Computation —) Category: Keyword: PSPACE-complete, computational complexity, two-player game, Chat Noir,
	Summary \| Full Text:PDF(244KB)

A Low Complexity H.264/AVC Deblocking Filter with Simplified Filtering Boundary Strength Decision Luong Pham VAN Hoyoung LEE Jaehwan KIM Byeungwoo JEON
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2013/02/01 Vol. E96-A No. 2 ; pp. 562-572 Type of Manuscript: PAPER Category: Digital Signal Processing Keyword: deblocking filter, H.264/AVC, computational complexity, human visual system,
	Summary \| Full Text:PDF(4.3MB)

Generalized Shisen-Sho is NP-Complete Chuzo IWAMOTO Yoshihiro WADA Kenichi MORITA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2012/11/01 Vol. E95-D No. 11 ; pp. 2712-2715 Type of Manuscript: LETTER Category: Fundamentals of Information Systems Keyword: NP-complete, computational complexity, one-player game, Shisen-Sho,
	Summary \| Full Text:PDF(595.1KB)

An Efficient Conical Area Evolutionary Algorithm for Bi-objective Optimization Weiqin YING Xing XU Yuxiang FENG Yu WU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2012/08/01 Vol. E95-A No. 8 ; pp. 1420-1425 Type of Manuscript: LETTER Category: Numerical Analysis and Optimization Keyword: bi-objective optimization, evolutionary algorithm, computational complexity, conical area, local Pareto optimality,
	Summary \| Full Text:PDF(353.4KB)

Verifying Structurally Weakly Persistent Net Is Co-NP Complete Atsushi OHTA Kohkichi TSUJI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2011/12/01 Vol. E94-A No. 12 ; pp. 2832-2835 Type of Manuscript: Special Section LETTER (Special Section on Mathematical Systems Science and its Applications) Category: Keyword: concurrent system, Petri net, subclass, computational complexity,
	Summary \| Full Text:PDF(139.6KB)

Fast and Simple 2D Shape Retrieval Using Discrete Shock Graph Solima KHANAM Seok-Woo JANG Woojin PAIK
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2011/10/01 Vol. E94-D No. 10 ; pp. 2059-2062 Type of Manuscript: LETTER Category: Image Recognition, Computer Vision Keyword: medial axes, shock graph, deform cost, visual transformation, computational complexity,
	Summary \| Full Text:PDF(653.3KB)

NP-Hard and k-EXPSPACE-Hard Cast Puzzles Chuzo IWAMOTO Kento SASAKI Kenji NISHIO Kenichi MORITA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2010/11/01 Vol. E93-D No. 11 ; pp. 2995-3004 Type of Manuscript: PAPER Category: Fundamentals of Information Systems Keyword: computational complexity, NP-hard, k-EXPSPACE hard, cast puzzle,
	Summary \| Full Text:PDF(645.8KB)

Low-Complexity Fusion Estimation Algorithms for Multisensor Dynamic Systems Seokhyoung LEE Vladimir SHIN
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2009/11/01 Vol. E92-A No. 11 ; pp. 2910-2916 Type of Manuscript: PAPER Category: Communication Theory and Signals Keyword: estimation, Kalman filtering, fusion formula, multisensor, Cholesky factorization, computational complexity,
	Summary \| Full Text:PDF(357.1KB)

Computational Complexity of Liveness Problem of Normal Petri Net Atsushi OHTA Kohkichi TSUJI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2009/11/01 Vol. E92-A No. 11 ; pp. 2717-2722 Type of Manuscript: Special Section PAPER (Special Section on Theory of Concurrent Systems and its Applications) Category: Keyword: concurrent system, Petri net, liveness, computational complexity,
	Summary \| Full Text:PDF(173.5KB)

Computational Complexities of University Interview Timetabling Naoyuki KAMIYAMA Yuuki KIYONARI Eiji MIYANO Shuichi MIYAZAKI Katsuhisa YAMANAKA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2009/02/01 Vol. E92-D No. 2 ; pp. 130-140 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: timetable, scheduling, optimization, computational complexity,
	Summary \| Full Text:PDF(602.5KB)

Formal Language Theoretic Approach to the Disclosure Tree Strategy in Trust Negotiation Yoshiaki TAKATA Hiroyuki SEKI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2009/02/01 Vol. E92-D No. 2 ; pp. 200-210 Type of Manuscript: Special Section PAPER (Special Section on Foundations of Computer Science) Category: Keyword: trust management, trust negotiation, negotiation strategy, computational complexity, context-free grammar,
	Summary \| Full Text:PDF(543.3KB)

Performance Evaluation of MIMO-OFDM with Twin Turbo Decoder Yasuyuki HATAKAWA Noriaki MIYAZAKI Toshinori SUZUKI
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2009/01/01 Vol. E92-B No. 1 ; pp. 228-236 Type of Manuscript: PAPER Category: Wireless Communication Technologies Keyword: iterative decoder, multiple-input multiple-output, FEC (Forward Error Correction), correlated channel, turbo coding, computational complexity,
	Summary \| Full Text:PDF(1012.2KB)

Design of a Fuzzy Based Outer Loop Controller for Improving the Training Performance of LMS Algorithm Ali OZEN Ismail KAYA Birol SOYSAL
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2008/12/01 Vol. E91-A No. 12 ; pp. 3738-3744 Type of Manuscript: Special Section PAPER (Special Section on Signal Design and its Applications in Communications) Category: Channel Equalization Keyword: channel equalization, tracking, fuzzy logic controller, computational complexity, convergence of training,
	Summary \| Full Text:PDF(700.1KB)

A Recursive Padding Technique on Nondeterministic Cellular Automata Chuzo IWAMOTO Harumasa YONEDA Kenichi MORITA Katsunobu IMAI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2008/09/01 Vol. E91-A No. 9 ; pp. 2335-2340 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: cellular automata, computational complexity, hierarchy theorem,
	Summary \| Full Text:PDF(216KB)

Initial Codebook Algorithm of Vector Quantizaton ShanXue CHEN FangWei LI WeiLe ZHU TianQi ZHANG
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2008/08/01 Vol. E91-D No. 8 ; pp. 2189-2191 Type of Manuscript: LETTER Category: Algorithm Theory Keyword: initialization method, computational complexity, vector quantization, image processing,
	Summary \| Full Text:PDF(377.8KB)

A Delayed Estimation Filter Using Finite Observations on Delay Interval HyongSoon KIM PyungSoo KIM SangKeun LEE
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2008/08/01 Vol. E91-A No. 8 ; pp. 2257-2262 Type of Manuscript: LETTER Category: Information Theory Keyword: delayed estimation, fixed-lag smoothing, Kalman filtering, computational complexity,
	Summary \| Full Text:PDF(322.7KB)

Fast Searching Algorithm for Vector Quantization Based on Subvector Technique ShanXue CHEN FangWei LI WeiLe ZHU TianQi ZHANG
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2008/07/01 Vol. E91-D No. 7 ; pp. 2035-2040 Type of Manuscript: PAPER Category: Image Processing and Video Processing Keyword: encoding, computational complexity, vector quantization, data compression, image processing,
	Summary \| Full Text:PDF(597KB)

Likelihood Estimation for Reduced-Complexity ML Detectors in a MIMO Spatial-Multiplexing System Masatsugu HIGASHINAKA Katsuyuki MOTOYOSHI Akihiro OKAZAKI Takayuki NAGAYASU Hiroshi KUBO Akihiro SHIBUYA
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2008/03/01 Vol. E91-B No. 3 ; pp. 837-847 Type of Manuscript: PAPER Category: Wireless Communication Technologies Keyword: MIMO, sphere decoding, QRD-M algorithm, soft-decision outputs, computational complexity,
	Summary \| Full Text:PDF(897.3KB)

Linearization of Loudspeaker Systems Using a Subband Parallel Cascade Volterra Filter Hideyuki FURUHASHI Yoshinobu KAJIKAWA Yasuo NOMURA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2007/08/01 Vol. E90-A No. 8 ; pp. 1616-1619 Type of Manuscript: Special Section LETTER (Special Section on Papers Selected from the 21st Symposium on Signal Processing) Category: Keyword: loudspeaker systems, nonlinear distortion, Volterra kernel, subband parallel cascade realization, computational complexity,
	Summary \| Full Text:PDF(419.5KB)

Low Complexity Encoding Based on Richardson's LDPC Codes Hyunseuk YOO Chang Hui CHOE Moon Ho LEE
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2007/08/01 Vol. E90-B No. 8 ; pp. 2151-2154 Type of Manuscript: LETTER Category: Fundamental Theories for Communications Keyword: finite fields, circulant permutation matrices, Richardson's encoding scheme, computational complexity,
	Summary \| Full Text:PDF(192.9KB)

Butterfly Structure for Viterbi Decoders of All Rates k/n Tsung Sheng KUO Chau-Yun HSU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2007/02/01 Vol. E90-A No. 2 ; pp. 504-510 Type of Manuscript: PAPER Category: Coding Theory Keyword: butterfly structure, Viterbi decoder, convolutional codes, computational complexity,
	Summary \| Full Text:PDF(548.5KB)

Optimization Design of Biorthogonal Wavelets for Embedded Image Coding Zaide LIU Nanning ZHENG Yuehu LIU Huub VAN DE WETERING
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2007/02/01 Vol. E90-D No. 2 ; pp. 569-578 Type of Manuscript: PAPER Category: Image Processing and Video Processing Keyword: biorthogonal wavelets, coding gain, compression performance, computational complexity, Diophantine equation, discrete wavelet transform, filter bank,
	Summary \| Full Text:PDF(425.2KB)

A Co-channel Interference Cancellation Method Using Low Dimensional Sphere Decoding for MIMO Communication Systems Masatsugu HIGASHINAKA Akihiro OKAZAKI Katsuyuki MOTOYOSHI Takayuki NAGAYASU Hiroshi KUBO Akihiro SHIBUYA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/10/01 Vol. E89-A No. 10 ; pp. 2526-2534 Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications) Category: Coding Theory Keyword: MIMO, sphere decoding, co-channel interference, computational complexity,
	Summary \| Full Text:PDF(954.6KB)

Computing Automorphism Groups of Chordal Graphs Whose Simplicial Components Are of Small Size Seinosuke TODA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2006/08/01 Vol. E89-D No. 8 ; pp. 2388-2401 Type of Manuscript: INVITED PAPER (Special Section on Invited Papers from New Horizons in Computing) Category: Keyword: chordal graph, simplicial component, automorphism, isomorphism, computational group theory, algorithm, computational complexity,
	Summary \| Full Text:PDF(290.1KB)

Decoding the (23, 12, 7) Golay Code Using a Low-Complexity Scheme Ching-Lung CHR Szu-Lin SU Shao-Wei WU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/08/01 Vol. E89-A No. 8 ; pp. 2235-2238 Type of Manuscript: LETTER Category: Coding Theory Keyword: (23, 12, 7) binary Golay code, algebraic decoding scheme, step-by-step decoding, computational complexity,
	Summary \| Full Text:PDF(293KB)

DWT Domain On-Line Signature Verification Using the Pen-Movement Vector Isao NAKANISHI Hiroyuki SAKAMOTO Naoto NISHIGUCHI Yoshio ITOH Yutaka FUKUI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/04/01 Vol. E89-A No. 4 ; pp. 1129-1131 Type of Manuscript: LETTER Category: Information Security Keyword: on-line signature verification, DWT, pen-movement vector, computational complexity,
	Summary \| Full Text:PDF(94.1KB)

A Simple Step-by-Step Decoding of Binary BCH Codes Ching-Lung CHR Szu-Lin SU Shao-Wei WU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2005/08/01 Vol. E88-A No. 8 ; pp. 2236-2239 Type of Manuscript: LETTER Category: Coding Theory Keyword: BCH code, step-by-step decoding, matrix computation, computational complexity,
	Summary \| Full Text:PDF(654.8KB)

A Subspace Blind Identification Algorithm with Reduced Computational Complexity--Colored Noise Case-- Nari TANABE Toshihiro FURUKAWA Kohichi SAKANIWA Shigeo TSUJII
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2005/07/01 Vol. E88-A No. 7 ; pp. 2015-2018 Type of Manuscript: LETTER Category: Digital Signal Processing Keyword: principal component analysis, subspace method, colored observation noise, noise variance, channel order, computational complexity,
	Summary \| Full Text:PDF(264.6KB)

Computational and Memory Complexities of Greengard-Rokhlin's Fast Multipole Algorithm Norimasa NAKASHIMA Mitsuo TATEIBA
Publication: IEICE TRANSACTIONS on Electronics Publication Date: 2005/07/01 Vol. E88-C No. 7 ; pp. 1516-1520 Type of Manuscript: LETTER Category: Electromagnetic Theory Keyword: Greengard-Rokhlin's algorithm, fast multipole method, computational complexity, memory complexity,
	Summary \| Full Text:PDF(189.1KB)

Strong Identification Based on a Hard-on-Average Problem Pino CABALLERO-GIL
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2005/05/01 Vol. E88-A No. 5 ; pp. 1117-1121 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: cryptography, computational complexity, algorithms, discrete mathematics,
	Summary \| Full Text:PDF(101.3KB)

Finding Yozume of Generalized Tsume-Shogi is Exptime-Complete Takayuki YATO Takahiro SETA Tsuyoshi ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2005/05/01 Vol. E88-A No. 5 ; pp. 1249-1257 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: computational complexity, generalized Tsume-Shogi, yozume, combinatorial games, another solution problem,
	Summary \| Full Text:PDF(192.3KB)

Zero-Knowledge Proof for the Independent Set Problem Pino CABALLERO-GIL
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2005/05/01 Vol. E88-A No. 5 ; pp. 1301-1302 Type of Manuscript: Special Section LETTER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: cryptography, computational complexity, algorithms, discrete mathematics,
	Summary \| Full Text:PDF(61.1KB)

A Low-Complexity Step-by-Step Decoding Algorithm for Binary BCH Codes Ching-Lung CHR Szu-Lin SU Shao-Wei WU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2005/01/01 Vol. E88-A No. 1 ; pp. 359-365 Type of Manuscript: PAPER Category: Coding Theory Keyword: BCH code, step-by-step decoding, matrix computation, computational complexity,
	Summary \| Full Text:PDF(943.7KB)

A Practical Subspace Blind Identification Algorithm with Reduced Computational Complexity Nari TANABE Toshihiro FURUKAWA Kohichi SAKANIWA Shigeo TSUJII
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/12/01 Vol. E87-A No. 12 ; pp. 3360-3371 Type of Manuscript: PAPER Category: Digital Signal Processing Keyword: principal component analysis, autocorrelation, subspace method, eigenvalue and singular-value decomposition, computational complexity, channel order, noise variance,
	Summary \| Full Text:PDF(1.3MB)

Efficient Codebook Search Method for AMR Wideband Speech Codecs Hochong PARK Younhee KIM Jisang YOO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2004/08/01 Vol. E87-D No. 8 ; pp. 2114-2120 Type of Manuscript: PAPER Category: Speech and Hearing Keyword: AMR wideband codec, ACELP, codebook search, computational complexity, pulse codevector,
	Summary \| Full Text:PDF(578.1KB)

Reduction of Background Computations in Block-Matching Motion Estimation Vasily G. MOSHNYAGA Koichi MASUNAGA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/03/01 Vol. E87-A No. 3 ; pp. 539-546 Type of Manuscript: Special Section PAPER (Special Section on Applications and Implementations of Digital Signal Processing) Category: Video/Image Coding Keyword: motion estimation, video coding, computational complexity, hardware architecture, adaptive processing,
	Summary \| Full Text:PDF(633.3KB)

The Dynamic-Typed Access Matrix Model and Decidability of the Safety Problem Masakazu SOSHI Mamoru MAEKAWA Eiji OKAMOTO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/01/01 Vol. E87-A No. 1 ; pp. 190-203 Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security) Category: Applications Keyword: access control, access matrix model, safety problem, computational complexity, decidability,
	Summary \| Full Text:PDF(697.9KB)

Complexity and Completeness of Finding Another Solution and Its Application to Puzzles Takayuki YATO Takahiro SETA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/05/01 Vol. E86-A No. 5 ; pp. 1052-1060 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: computational complexity, NP-complete, another solution, puzzle,
	Summary \| Full Text:PDF(282.3KB)

Software Obfuscation on a Theoretical Basis and Its Implementation Toshio OGISO Yusuke SAKABE Masakazu SOSHI Atsuko MIYAJI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/01/01 Vol. E86-A No. 1 ; pp. 176-186 Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security) Category: Protocols etc. Keyword: tamper-resistant software, obfuscation, static analysis, computational complexity,
	Summary \| Full Text:PDF(744.1KB)

A Computation Reduced MMSE Adaptive Array Antenna Using Space-Temporal Simultaneous Processing Equalizer Yoshihiro ICHIKAWA Koji TOMITSUKA Shigeki OBOTE Kenichi KAGOSHIMA
Publication: IEICE TRANSACTIONS on Communications Publication Date: 2002/12/01 Vol. E85-B No. 12 ; pp. 2622-2629 Type of Manuscript: Special Section PAPER (Special Issue on Software Defined Radio Technology and Its Applications) Category: Keyword: adaptive array antenna, MMSE, computational complexity, space-temporal simultaneous processing equalizer,
	Summary \| Full Text:PDF(649KB)

NP-Hardness of Liveness Problem of Bounded Asymmetric Choice Net Atsushi OHTA Kohkichi TSUJI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2002/05/01 Vol. E85-A No. 5 ; pp. 1071-1074 Type of Manuscript: Special Section LETTER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: concurrent system, Petri net, liveness, computational complexity,
	Summary \| Full Text:PDF(263.3KB)

A Note on Realtime One-Way Alternating and Deterministic Multi-Counter Automata Tsunehiro YOSHINAGA Katsushi INOUE
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2002/02/01 Vol. E85-D No. 2 ; pp. 346-349 Type of Manuscript: Special Section LETTER (Special Issue on Selected Papers from LA Symposium) Category: Keyword: alternating multi-counter automata, deterministic multi-counter automata, one-way computation, realtime computation, computational complexity,
	Summary \| Full Text:PDF(140.5KB)

On Cellular Arrays and Other Topics in Parallel Computing Oscar H. IBARRA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2002/02/01 Vol. E85-D No. 2 ; pp. 312-321 Type of Manuscript: INVITED SURVEY PAPER Category: Keyword: cellular array, computational complexity, parallel complexity, reachability, commutativity analysis,
	Summary \| Full Text:PDF(259.6KB)

Polynomial Time Decidability of Monotone Liveness of Time Bounded AC/DC Nets Atsushi OHTA Kohkichi TSUJI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2001/11/01 Vol. E84-A No. 11 ; pp. 2865-2870 Type of Manuscript: Special Section PAPER (Special Section on Concurrent Systems Technology) Category: Keyword: concurrent system, Petri net, liveness, computational complexity,
	Summary \| Full Text:PDF(223.4KB)

On the Complexity of Constructing an Elliptic Curve of a Given Order Masato YAMAMICHI Masahiro MAMBO Hiroki SHIZUYA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2001/01/01 Vol. E84-A No. 1 ; pp. 140-145 Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security) Category: Keyword: elliptic curve, function class, computational complexity,
	Summary \| Full Text:PDF(215.8KB)

Computational Complexity of Finding Highly Co-occurrent Itemsets in Market Basket Databases Yeon-Dae KWON Yasunori ISHIHARA Shougo SHIMIZU Minoru ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/12/25 Vol. E83-A No. 12 ; pp. 2723-2735 Type of Manuscript: PAPER Category: General Fundamentals and Boundaries Keyword: data mining, large itemset, highly co-occurrent itemset, computational complexity,
	Summary \| Full Text:PDF(300.4KB)

The Optimal Sectionalized Trellises for the Generalized Version of Viterbi Algorithm of Linear Block Codes and Its Application to Reed-Muller Codes Yuansheng TANG Toru FUJIWARA Tadao KASAMI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/11/25 Vol. E83-A No. 11 ; pp. 2329-2340 Type of Manuscript: PAPER Category: Coding Theory Keyword: linear block code, sectionalization, minimal sectionalized trellis, generalized Viterbi algorithm, computational complexity,
	Summary \| Full Text:PDF(508.3KB)

NP-Completeness of Reallocation Problems with Restricted Block Volume Hiroyoshi MIWA Hiro ITO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/04/25 Vol. E83-A No. 4 ; pp. 590-597 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: reallocation, computational complexity, NP-complete, SAT, steiner tree problem,
	Summary \| Full Text:PDF(536.7KB)

NP-Hardness of Rotation Type Cell-Mazes Shiro AOKI Hiro ITO Hideyuki UEHARA Mitsuo YOKOYAMA Tsuyoshi HORINOUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/03/25 Vol. E83-A No. 3 ; pp. 492-496 Type of Manuscript: Special Section LETTER (Special Section of Selected Papers from the 12th Workshop on Circuits and Systems in Karuizawa) Category: Keyword: puzzle, maze, computational complexity, NP-hard, polynomial-time,
	Summary \| Full Text:PDF(472.6KB)

Computational Complexity of Finding Meaningful Association Rules Yeon-Dae KWON Ryuichi NAKANISHI Minoru ITO Michio NAKANISHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1999/09/25 Vol. E82-A No. 9 ; pp. 1945-1952 Type of Manuscript: PAPER Category: Algorithms and Data Structures Keyword: data mining, large itemset, meaningful association rule, computational complexity, database,
	Summary \| Full Text:PDF(529.4KB)

On Complexity of Computing the Permanent of a Rectangular Matrix Tsutomu KAWABATA Jun TARUI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1999/05/25 Vol. E82-A No. 5 ; pp. 741-744 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: permanent, computational complexity, differential operator on circuits,
	Summary \| Full Text:PDF(321.2KB)

Computationally Efficient Bicomplex Multipliers for Digital Signal Processing Hisamichi TOYOSHIMA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1998/02/25 Vol. E81-D No. 2 ; pp. 236-238 Type of Manuscript: LETTER Category: Algorithm and Computational Complexity Keyword: computational complexity, hypercomplex number, bicomplex multiplier, digital signal processing,
	Summary \| Full Text:PDF(221.1KB)

A Note on the Complexity of k-Ary Threshold Circuits Shao-Chin SUNG Kunihiko HIRAISHI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1997/08/25 Vol. E80-D No. 8 ; pp. 767-773 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: computational complexity, threshold circuit, symmetric function,
	Summary \| Full Text:PDF(488.3KB)

Syntactic Unification Problems under Constrained Substitutions Kazuhiro TAKADA Yuichi KAJI Tadao KASAMI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1997/05/25 Vol. E80-D No. 5 ; pp. 553-561 Type of Manuscript: PAPER Category: Automata,Languages and Theory of Computing Keyword: unification problem, decidability, computational complexity, order-sorted signature, tree automata,
	Summary \| Full Text:PDF(739.2KB)

Computational Power of Nondeterministic Ordered Binary Decision Diagrams and Their Subclasses Kazuyoshi TAKAGI Koyo NITTA Hironori BOUNO Yasuhiko TAKENAGA Shuzo YAJIMA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1997/04/25 Vol. E80-A No. 4 ; pp. 663-669 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: computational complexity, Boolean function, ordered binary decision diagram, satisfiability, combinational circuit, cutwidth, sum-of-product form, zero-suppressed binary decision diagrams (BDD), ternary decision diagram,
	Summary \| Full Text:PDF(675.4KB)

Computing the Minkowski Sum of Monotone Polygons Antonio HERNAN'DEZ-BARRERA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1997/02/25 Vol. E80-D No. 2 ; pp. 218-222 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: algorithms, computational complexity, computational geometry, Minkowski sum, monotone polygon, lower envelope,
	Summary \| Full Text:PDF(403.9KB)

The Complexity of Threshold Circuits for Parity Functions Shao-Chin SUNG Tetsuro NISHINO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1997/01/25 Vol. E80-D No. 1 ; pp. 91-93 Type of Manuscript: LETTER Category: Algorithm and Computational Complexity Keyword: computational complexity, threshold circuit, parity function,
	Summary \| Full Text:PDF(221.7KB)

A Relationship between the Number of Negations and the Circuit Size Keisuke TANAKA Tetsuro NISHINO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1996/09/25 Vol. E79-D No. 9 ; pp. 1355-1357 Type of Manuscript: LETTER Category: Algorithm and Computational Complexity Keyword: computational complexity, theory of computation,
	Summary \| Full Text:PDF(216.9KB)

Digital Halftoning Algorithms Based on Optimization Criteria and Their Experimental Evaluation Tetsuo ASANO Desh RANJAN Thomas ROOS
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1996/04/25 Vol. E79-A No. 4 ; pp. 524-532 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: discrete algorithm, combinatiorial optimization, digital halftoning, computational complexity, experimental evaluation,
	Summary \| Full Text:PDF(1002.5KB)

A Fast and Accurate Algorithm for Computing Desired Eigenpairs of Hermitian Matrices Chang Wan JEON Hyoung Joong KIM Jang Gyu LEE
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1996/03/25 Vol. E79-D No. 3 ; pp. 182-188 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: eigenvalue, eigenvector, algorithm, computational complexity,
	Summary \| Full Text:PDF(518.8KB)

On the Complexity of the Discrete Logarithm for a General Finite Group Tatsuaki OKAMOTO Kouichi SAKURAI Hiroki SHIZUYA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1996/01/25 Vol. E79-A No. 1 ; pp. 61-65 Type of Manuscript: Special Section PAPER (Special Section on Cryptography and Information Security) Category: Keyword: discrete logarithm, computational complexity, cryptography,
	Summary \| Full Text:PDF(504.7KB)

A Mathematical Solution to a Network Designing Problem Yoshikane TAKAHASHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1995/10/25 Vol. E78-A No. 10 ; pp. 1381-1411 Type of Manuscript: PAPER Category: Neural Networks Keyword: neural networks, network designing, network training, minimum intermediate units, computational complexity, rate distortion theory, linear algebra,
	Summary \| Full Text:PDF(2.3MB)

A Priori Estimation of Newton Type Homotopy Method for Calculating an Optimal Solution of Convex Optimization Problem Mitsunori MAKINO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1995/10/25 Vol. E78-A No. 10 ; pp. 1339-1344 Type of Manuscript: Special Section PAPER (Special Section on Nonlinear Theory and Its Applications) Category: Keyword: homotopy method, convex programming, nonlinear programming, computational complexity, monotone operator, nonlinear system analysis,
	Summary \| Full Text:PDF(412.8KB)

Alternating Finite Automata with Counters and Stack-Counters Operating in Realtime Tsunehiro YOSHINAGA Katsushi INOUE
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1995/08/25 Vol. E78-D No. 8 ; pp. 929-938 Type of Manuscript: PAPER Category: Automata, Languages and Theory of Computing Keyword: alternation, realtime computation, one-way counter automata, one-way stack-counter automata, computational complexity,
	Summary \| Full Text:PDF(816.5KB)

Learning Theory Toward Genome Informatics Satoru MIYANO
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1995/05/25 Vol. E78-D No. 5 ; pp. 560-567 Type of Manuscript: Special Section PAPER (Special Issue on Algorithmic Learning Theory) Category: Machine Learning and Its Applications Keyword: PAC-learning, computational complexity, knowledge acquisition, genome informaics,
	Summary \| Full Text:PDF(765.2KB)

On the Negation-Limited Circuit Complexity of Clique Functions Tetsuro NISHINO Keisuke TANAKA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1995/01/25 Vol. E78-D No. 1 ; pp. 86-89 Type of Manuscript: LETTER Category: Algorithm and Computational Complexity Keyword: computational complexity, boolean circuit, clique function,
	Summary \| Full Text:PDF(217.4KB)

On the Number of Negations Needed to Compute Parity Functions Tetsuro NISHINO Jaikumar RADHAKRISHNAN
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1995/01/25 Vol. E78-D No. 1 ; pp. 90-91 Type of Manuscript: LETTER Category: Algorithm and Computational Complexity Keyword: computational complexity, boolean circuit, parity function,
	Summary \| Full Text:PDF(152.1KB)

Finite State Translation Systems and Parallel Multiple Context-Free Grammars Yuichi KAJI Hiroyuki SEKI Tadao KASAMI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1994/06/25 Vol. E77-D No. 6 ; pp. 619-630 Type of Manuscript: PAPER Category: Automata, Languages and Theory of Computing Keyword: finite state translation systems, parallel multiple context-free grammars, tree automata, computational complexity, formal languages,
	Summary \| Full Text:PDF(925KB)

Hierarchical Properties of Realtime One-Way Alternating Multi-Stack-Counter Automata Tsunehiro YOSHINAGA Katsushi INOUE Itsuo TAKANAMI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1994/04/25 Vol. E77-A No. 4 ; pp. 621-629 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: alternating automata, one-way counter, one-way stack-counter, computational complexity,
	Summary \| Full Text:PDF(741.4KB)

On the Complexity of Protocol Validation Problems for Protocols with Bounded Capacity Channels Yoshiaki KAKUDA Yoshihiro TAKADA Tohru KIKUNO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1994/04/25 Vol. E77-A No. 4 ; pp. 658-667 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: computational complexity, deadlock, NP-complete, protocol, protocol validation,
	Summary \| Full Text:PDF(781.5KB)

A Note on One-Way Multicounter Machines and Cooperating Systems of One-Way Finite Automata Yue WANG Katsushi INOUE Itsuo TAKANAMI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1993/10/25 Vol. E76-D No. 10 ; pp. 1302-1306 Type of Manuscript: LETTER Category: Automaton, Language and Theory of Computing Keyword: one-way multicounter automata, cooperating systems of one-way finite automata, hierarchy, computational complexity,
	Summary \| Full Text:PDF(380.1KB)

Some Hierarchy Results on Multihead Automata over a One-Letter Alphabet Yue WANG Katsushi INOUE Itsuo TAKANAMI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1993/06/25 Vol. E76-D No. 6 ; pp. 625-633 Type of Manuscript: PAPER Category: Automaton, Language and Theory of Computing Keyword: sensing multihead automata, automata on two-dimensional tapes, one-letter alphabet, hierarchy, computational complexity,
	Summary \| Full Text:PDF(651.8KB)

A Sufficient Condition of A Priori Estimation for Computational Complexity of the Homotopy Method Mitsunori MAKINO Masahide KASHIWAGI Shin'ichi OISHI Kazuo HORIUCHI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1993/05/25 Vol. E76-A No. 5 ; pp. 786-794 Type of Manuscript: Special Section PAPER (Special Section on Neural Nets,Chaos and Numerics) Category: Numerical Homotopy Method and Self-Validating Numerics Keyword: numerical methods, nonliner system analysis, homotopy method, computational complexity, monotone operator,
	Summary \| Full Text:PDF(625.9KB)

A Linear Time Algorithm for Smallest Augmentation to 3-Edge-Connect a Graph Toshimasa WATANABE Mitsuhiro YAMAKADO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 1993/04/25 Vol. E76-A No. 4 ; pp. 518-531 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: linear-time algorithms, 3-edge-connected graphs, connectivity augmentation, computational complexity,
	Summary \| Full Text:PDF(1.1MB)

Some EXPTIME Complete Problems on Context-Free Languages Takumi KASAI Shigeki IWATA
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1993/03/25 Vol. E76-D No. 3 ; pp. 329-335 Type of Manuscript: PAPER Category: Algorithm and Computational Complexity Keyword: computational complexity, EXPTIME complete, context-free language, pebble game problem,
	Summary \| Full Text:PDF(564.3KB)

The Universal Recognition Problems for Parallel Multiple Context-Free Grammars and for Their Subclasses Yuichi KAJI Ryuichi NAKANISHI Hiroyuki SEKI Tadao KASAMI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1992/07/25 Vol. E75-D No. 4 ; pp. 499-508 Type of Manuscript: PAPER Category: Automaton, Language and Theory of Computing Keyword: parallel multiple context-free grammars, universal recognition problem, computational complexity, formal language,
	Summary \| Full Text:PDF(810.4KB)

The Universal Recognition Problems for Multiple Context-Free Grammars and for Linear Context-Free Rewriting Systems Yuichi KAJI Ryuichi NAKANISI Hiroyuki SEKI Tadao KASAMI
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 1992/01/25 Vol. E75-D No. 1 ; pp. 78-88 Type of Manuscript: Special Section PAPER (Special Section on Theoretical Foundations of Computing) Category: Keyword: multiple context-free grammars, recognition problem, computational complexity, formal language,
	Summary \| Full Text:PDF(881.6KB)