Hassan Noori
I was a master student in field of Computational Algebra, pure Mathematics at Damgahn University.
I'm study on Gröbner bases Theory and its Applications.
Also I'm interested in Data structure which used to Monomial representations and operations.
In additions, I'm study on SAGBI-Gröbner basis which is generalized version of the Gröbner bases for ideal of sub-algebra.
Supervisors: Sajjad Rahmany and Abdolali Basiri
Phone: +98-919-4725630
I'm study on Gröbner bases Theory and its Applications.
Also I'm interested in Data structure which used to Monomial representations and operations.
In additions, I'm study on SAGBI-Gröbner basis which is generalized version of the Gröbner bases for ideal of sub-algebra.
Supervisors: Sajjad Rahmany and Abdolali Basiri
Phone: +98-919-4725630
less
Related Authors
InterestsView All (7)
Uploads
Papers by Hassan Noori
bases theory and some applications of Gröbner bases.
1. The 3-Colorable Problem
2. Application in Cryptography
3. Automatic Geometric Theorem Proving
The advantage of this algorithm lies in the fact that it replaces the classical polynomial reduction by the simultaneous reduction of several polynomials in order to avoid as much as possible intermediate computations.
Talks by Hassan Noori
of polynomial equations, robotics, coding theory, optimization, mathematical biology, computer vision, game theory, statistics, machine learning, control theory and many
others.
Suppose we are given polynomials f1,...,fs in K[x1,..., xn] which are known to have only finitely many common zeros. Then I = <f1,...,fs>, the ideal generated by these polynomials, is zero-dimensional. In this talk we demonstrate how Gröbner bases can be used to compute the zeros of I.
bases theory and some applications of Gröbner bases.
1. The 3-Colorable Problem
2. Application in Cryptography
3. Automatic Geometric Theorem Proving
The advantage of this algorithm lies in the fact that it replaces the classical polynomial reduction by the simultaneous reduction of several polynomials in order to avoid as much as possible intermediate computations.
of polynomial equations, robotics, coding theory, optimization, mathematical biology, computer vision, game theory, statistics, machine learning, control theory and many
others.
Suppose we are given polynomials f1,...,fs in K[x1,..., xn] which are known to have only finitely many common zeros. Then I = <f1,...,fs>, the ideal generated by these polynomials, is zero-dimensional. In this talk we demonstrate how Gröbner bases can be used to compute the zeros of I.