Search ResultsElektronik Kaynaklar
Liste görünümüne geç
Küçük resim görünümüne geç
Eylem Seç
5 sonuç bulundu Arama sonuçlarına abone ol
00000DEFAULTTR
Yazdır
Liste seç
Bunu varsayılan liste yap.
Öğeler başarıyla eklendi
    Öğeler eklenirken hata oldu. Lütfen tekrar deneyiniz.
      The Computational Complexity of Presburger Arithmetic için kapak resmi
      1. 
      The Computational Complexity of Presburger Arithmetic
      by 
      Nguyen Luu, Danh, author.
      http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:10828057
      Format: 
      Alıntı: 
      The Computational Complexity of Presburger Arithmetic / Nguyen Luu, Danh, author.
      On the Efficiency of Algorithms for Tensor Decompositions and Their Applications için kapak resmi
      2. 
      On the Efficiency of Algorithms for Tensor Decompositions and Their Applications
      by 
      Rouse, Kathryn, author.
      http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:10814882
      Format: 
      Alıntı: 
      algorithms may be used to reduce both the communication and computational complexity of matrix multiplication
      Analysis of High Performance Scientific Programming Workflows için kapak resmi
      3. 
      Analysis of High Performance Scientific Programming Workflows
      by 
      Klaassen, W.K. Umayanganie, author.
      http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:10825859
      Format: 
      Alıntı: 
      -to-source compiler with respect to productivity of programming FPGAs using a computational chemistry code. We compare
      An Outer Approximate Approach to TOA-Based Multiple Source Localization Problem için kapak resmi
      4. 
      An Outer Approximate Approach to TOA-Based Multiple Source Localization Problem
      by 
      Luo, Wenzhou, author.
      http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:10904532
      Format: 
      Alıntı: 
      computational complexity and non-convex property. As the large number source localization problem has wide
      List-decoding Homomorphism Codes için kapak resmi
      5. 
      List-decoding Homomorphism Codes
      by 
      Wuu, Angela, author.
      http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:10809503
      Format: 
      Alıntı: 
      interest, both as a problem in computational group theory and as a new and natural problem in NP of