Add to ORKGThesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991.Includes bibliographical references (leaves 86-89).by Brian A. LaMacchia.M.S
Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Abstract. The dynamic algorithm to compute a Gröbner basis is nearly twenty years old, yet it seems ...
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This thesis investigates a new approach to lattice basis reduction suggested by M. Seysen. Seysen'...
We report on improved practical algorithms for lattice basis reduction. We propose a practical float...
. The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brick...
The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickel...
In recent years many advances have been made in solution techniques for specially structured 0–1 int...
This report collects some useful results from commutative algebra and describes how they can be used...
This software contains code supporting the numerical experiments for the preprint A Training Set Sub...
The goal of the Dynamic Buchberger Algorithm is to compute a Gröbner basis quickly by adjusting the ...
We generalize the concept of block reduction for lattice bases from l2-norm to arbitrary norms. This...
The goal of the Dynamic Buchberger Algorithm is to compute a Gröbner basis quickly by adjusting the ...
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
dissertationThis dissertation is about analyzing and visualizing datasets using basis selection tech...
Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Abstract. The dynamic algorithm to compute a Gröbner basis is nearly twenty years old, yet it seems ...
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
This thesis investigates a new approach to lattice basis reduction suggested by M. Seysen. Seysen'...
We report on improved practical algorithms for lattice basis reduction. We propose a practical float...
. The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brick...
The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickel...
In recent years many advances have been made in solution techniques for specially structured 0–1 int...
This report collects some useful results from commutative algebra and describes how they can be used...
This software contains code supporting the numerical experiments for the preprint A Training Set Sub...
The goal of the Dynamic Buchberger Algorithm is to compute a Gröbner basis quickly by adjusting the ...
We generalize the concept of block reduction for lattice bases from l2-norm to arbitrary norms. This...
The goal of the Dynamic Buchberger Algorithm is to compute a Gröbner basis quickly by adjusting the ...
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...
dissertationThis dissertation is about analyzing and visualizing datasets using basis selection tech...
Thesis (B.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Abstract. The dynamic algorithm to compute a Gröbner basis is nearly twenty years old, yet it seems ...
Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer...