IEICE Trans

Keyword : NP-complete problem

A Digital Signature Scheme Based on NP-Complete Lattice Problems Shunichi HAYASHI Mitsuru TADA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2008/05/01 Vol. E91-A No. 5 ; pp. 1253-1264 Type of Manuscript: PAPER Category: Cryptography and Information Security Keyword: NP-complete problem, lattice, identification scheme, signature scheme,
	Summary \| Full Text:PDF

New NP-Complete Problems Associated with Lattices Shunichi HAYASHI Mitsuru TADA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2007/05/01 Vol. E90-A No. 5 ; pp. 941-948 Type of Manuscript: Special Section PAPER (Special Section on Discrete Mathematics and Its Applications) Category: Keyword: NP-complete problem, lattice, ELVP, BELVP, NELVP,
	Summary \| Full Text:PDF

Solving the Graph Planarization Problem Using an Improved Genetic Algorithm Rong-Long WANG Kozo OKAZAKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/05/01 Vol. E89-A No. 5 ; pp. 1507-1512 Type of Manuscript: LETTER Category: Numerical Analysis and Optimization Keyword: graph planarization problem, NP-complete problem, genetic algorithm,
	Summary \| Full Text:PDF

A Hill-Shift Learning Algorithm of Hopfield Network for Bipartite Subgraph Problem Rong-Long WANG Kozo OKAZAKI
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2006/01/01 Vol. E89-A No. 1 ; pp. 354-358 Type of Manuscript: LETTER Category: Neural Networks and Bioengineering Keyword: bipartite subgraph problem, Hopfield neural network, hill-shift learning, NP-complete problem,
	Summary \| Full Text:PDF

Stochastic Competitive Hopfield Network and Its Application to Maximum Clique Problem Jiahai WANG Zheng TANG Qiping CAO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/10/01 Vol. E87-A No. 10 ; pp. 2790-2798 Type of Manuscript: PAPER Category: Neural Networks and Bioengineering Keyword: maximum clique problem, optimal competitive Hopfield model, stochastic dynamistic, NP-complete problem,
	Summary \| Full Text:PDF

An Expanded Maximum Neural Network with Chaotic Dynamics for Cellular Radio Channel Assignment Problem Jiahai WANG Zheng TANG Hiroki TAMURA Xinshun XU
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/08/01 Vol. E87-A No. 8 ; pp. 2092-2099 Type of Manuscript: PAPER Category: Nonlinear Problems Keyword: channel assignment problem, expanded maximum neural network, transient chaos, NP-complete problem,
	Summary \| Full Text:PDF

A Chaotic Maximum Neural Network for Maximum Clique Problem Jiahai WANG Zheng TANG Ronglong WANG
Publication: IEICE TRANSACTIONS on Information and Systems Publication Date: 2004/07/01 Vol. E87-D No. 7 ; pp. 1953-1961 Type of Manuscript: PAPER Category: Biocybernetics, Neurocomputing Keyword: maximum clique problem, maximum neural network, transient chaos, NP-complete problem,
	Summary \| Full Text:PDF

A Near-Optimum Parallel Algorithm for a Graph Layout Problem Rong-Long WANG Xin-Shun XU Zheng TANG
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2004/02/01 Vol. E87-A No. 2 ; pp. 495-501 Type of Manuscript: PAPER Category: Neural Networks and Bioengineering Keyword: graph layout, crossing number, NP-complete problem, Hopfield neural network, learning algorithm,
	Summary \| Full Text:PDF

Solving Maximum Cut Problem Using Improved Hopfield Neural Network Rong-Long WANG Zheng TANG Qi-Ping CAO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2003/03/01 Vol. E86-A No. 3 ; pp. 722-729 Type of Manuscript: PAPER Category: Neural Networks and Bioengineering Keyword: maximum cut problem, Hopfield-type neural network, internal dynamics, NP-complete problem,
	Summary \| Full Text:PDF

A Near-Optimum Parallel Algorithm for Bipartite Subgraph Problem Using the Hopfield Neural Network Learning Rong-Long WANG Zheng TANG Qi-Ping CAO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2002/02/01 Vol. E85-A No. 2 ; pp. 497-504 Type of Manuscript: PAPER Category: Neural Networks and Bioengineering Keyword: bipartite subgraph problem, maximum cut problem, Hopfield neural network, gradient ascent learning, NP-complete problem,
	Summary \| Full Text:PDF

A Hopfield Network Learning Algorithm for Graph Planarization Zheng TANG Rong Long WANG Qi Ping CAO
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2001/07/01 Vol. E84-A No. 7 ; pp. 1799-1802 Type of Manuscript: LETTER Category: Neural Networks and Bioengineering Keyword: graph planarization, Hopfield neural network, gradient ascent learning, NP-complete problem,
	Summary \| Full Text:PDF

A Scheduling Problem in Multihop Networks Kaoru WATANABE Masakazu SENGOKU Hiroshi TAMURA Keisuke NAKANO Shoji SHINODA
Publication: IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Publication Date: 2000/06/25 Vol. E83-A No. 6 ; pp. 1222-1227 Type of Manuscript: PAPER Category: Graphs and Networks Keyword: multihop network, mobile communication, graph theory, NP-complete problem, cut covering,
	Summary \| Full Text:PDF