The Computational Complexity of Presburger Arithmetic.
- 주제(키워드) ARITHMETIC , COMPLEXITY , COMPUTATIONAL , Complexity , INTEGER PROGRAMMING , Integer programming , PRESBURGER , PRESBURGER ARITHMETIC , Presburger arithmetic , SHORT GENERATING FUNCTIONS , Short generating functions
- 발행기관 University of California, Los Angeles
- 발행년도 2018
- 학위명 박사
- 학과 및 전공 Mathematics
- UCI I804:11009-000000156485
- DOI 10.23186/korea.000000156485.11009.0001101
- 제출원본 PQDT10828057
