Keyword : computation complexity


Complexity and a Heuristic Algorithm of Computing Parallel Degree for Program Nets with SWITCH-Nodes
Shingo YAMAGUCHI Tomohiro TAKAI Tatsuya WATANABE Qi-Wei GE Minoru TANAKA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/11/01
Vol. E89-A  No. 11 ; pp. 3207-3215
Type of Manuscript:  Special Section PAPER (Special Section on Concurrent/Hybrid Systems: Theory and Applications)
Category: Concurrent Systems
Keyword: 
program netsparallel degreecomputation complexityNP-completeness
 Summary | Full Text:PDF(428.7KB)

Dead Problem of Program Nets
Shingo YAMAGUCHI Kousuke YAMADA Qi-Wei GE Minoru TANAKA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2006/04/01
Vol. E89-A  No. 4 ; pp. 887-894
Type of Manuscript:  Special Section PAPER (Special Section on Selected Papers from the 18th Workshop on Circuits and Systems in Karuizawa)
Category: 
Keyword: 
program netsdeaddead problemcomputation complexityNP-completeness
 Summary | Full Text:PDF(388.7KB)

An n3u Upper Bound on the Complexity for Deciding the Truth of a Presburger Sentence Involving Two Variables Bounded Only by Existential Quantifiers
Kuniaki NAOI Naohisa TAKAHASHI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 1997/02/25
Vol. E80-D  No. 2 ; pp. 223-231
Type of Manuscript:  PAPER
Category: Algorithm and Computational Complexity
Keyword: 
Presburger arithmeticautomatic theorem provercomputation complexityinteger programmingalgorithm
 Summary | Full Text:PDF(743.7KB)