Perbandingan Kecepatan Metode Brute Force dan Algoritme Divide and Conquer untuk Menentukan Varitas Aljabar Polinomial Multivariat Biner.
dc.contributor.advisor | Guritman, Sugi | |
dc.contributor.advisor | Siswandi | |
dc.contributor.author | Said, Mohamad Ali | |
dc.date.accessioned | 2021-03-20T03:32:49Z | |
dc.date.available | 2021-03-20T03:32:49Z | |
dc.date.issued | 2020 | |
dc.identifier.uri | http://repository.ipb.ac.id/handle/123456789/106350 | |
dc.description.abstract | Sembarang polinomial multivariat biner p anggota ring polinomial multivariat biner ... dst | id |
dc.language.iso | id | id |
dc.publisher | IPB University | id |
dc.title | Perbandingan Kecepatan Metode Brute Force dan Algoritme Divide and Conquer untuk Menentukan Varitas Aljabar Polinomial Multivariat Biner. | id |
dc.type | Undergraduate Thesis | id |
dc.subject.keyword | Algebraic variety | id |
dc.subject.keyword | Binary multivariate polynomial | id |
dc.subject.keyword | Boolean function | id |
dc.subject.keyword | Brute force | id |
dc.subject.keyword | Divide and conquer | id |
Files in this item
This item appears in the following Collection(s)
-
UT - Mathematics [1432]