Please use this identifier to cite or link to this item:
http://repository.ipb.ac.id/handle/123456789/106347| Title: | Perbandingan Kecepatan Metode Brute Force dan Algoritme Divide and Conquer untuk Menentukan Varitas Aljabar Polinomial Multivariat Biner. |
| Authors: | Guritman, Sugi Siswandi Said, Mohamad Ali |
| Issue Date: | 2020 |
| Publisher: | IPB University |
| Abstract: | Sembarang polinomial multivariat biner p anggota ring polinomial multivariat biner 𝔽����2[𝑥����1,𝑥����2,…,𝑥����𝑛����] pada skripsi ini dapat dipandang sebagai suatu fungsi Boolean 𝑝����∶ 𝔽����2𝑛����→𝔽����2. .. |
| URI: | http://repository.ipb.ac.id/handle/123456789/106347 |
| Appears in Collections: | UT - Mathematics |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| G54160090_MOHAMAD ALI SAID.pdf Restricted Access | Fullteks | 9.47 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.