Kuniaki NAOI


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