Computational ideal theory and groebner basis
For every ideal in a polynomial ring over a field, there exists a finite basis as stated by Hilbert's Basis Theorem. However, as classical proofs of the theorem are nonconstructive, several academics have attempted to develop constructive proofs of the theorem. Amongst them, Buchberger develope...
Saved in:
Main Author: | Zheng, Jia Li |
---|---|
Other Authors: | Wu Guohua |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/148504 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
GROEBNER BASES
by: CHENG CHE VICTOR
Published: (2021) -
Penyelesaian sistem persamaan polinomial menggunakan teknik basis groebner dan penerapannya dalam kriptanalisis
by: , RIYANTO, Muhamad Zaki, et al.
Published: (2010) -
RANCANG BANGUN KRIPTANALISIS DENGAN BASIS GROEBNER PADA SISTEM KRIPTOGRAFI
BERBASIS ALGORITMA HFE (Hidden Field Equation) MENGGUNAKAN ALGORITMA BUCHBERGER
by: , Edi Winarko, et al.
Published: (2014) -
Computability theory and applications
by: Khoo, Kai Jun
Published: (2023) -
Computability theory and algebra
by: Wu, Huishan
Published: (2017)