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 problemlatticeidentification schemesignature scheme
 Summary | Full Text:PDF(220KB)

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 problemlatticeELVPBELVPNELVP
 Summary | Full Text:PDF(185KB)

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 problemNP-complete problemgenetic algorithm
 Summary | Full Text:PDF(198.8KB)

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 problemHopfield neural networkhill-shift learningNP-complete problem
 Summary | Full Text:PDF(98.9KB)

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 problemoptimal competitive Hopfield modelstochastic dynamisticNP-complete problem
 Summary | Full Text:PDF(663.4KB)

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 problemexpanded maximum neural networktransient chaosNP-complete problem
 Summary | Full Text:PDF(920.5KB)

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 problemmaximum neural networktransient chaosNP-complete problem
 Summary | Full Text:PDF(399.2KB)

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 layoutcrossing numberNP-complete problemHopfield neural networklearning algorithm
 Summary | Full Text:PDF(174.2KB)

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 problemHopfield-type neural networkinternal dynamicsNP-complete problem
 Summary | Full Text:PDF(268.1KB)

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 problemmaximum cut problemHopfield neural networkgradient ascent learningNP-complete problem
 Summary | Full Text:PDF(291.2KB)

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 planarizationHopfield neural networkgradient ascent learningNP-complete problem
 Summary | Full Text:PDF(138KB)

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 networkmobile communicationgraph theoryNP-complete problemcut covering
 Summary | Full Text:PDF(589.1KB)