Loading...
Please wait, while we are loading the content...
Similar Documents
Un algoritmo para resolver el problema de Frobenius utilizando bases de Gröbner
| Content Provider | Semantic Scholar |
|---|---|
| Author | Garc'ia-Pulgar'in, Gilberto Hermes, John Gómez, Castillo |
| Copyright Year | 2008 |
| Abstract | Let A ={a1,a2,...,ak} be a set of relatively positive prime integers, a positive integer N is called representable byA if exists non-negatives integersx1,x2,...,xk, such thatN = P k=1 aixi. The Frobenius Problem consits in determining the largest integer, denoted with g(A), that is not representable by A. In this work we present an algorithm to solve the Frobenius Problem using Grobner Bases. In the Apendix we present the algorithms developed in this work, implemented in the computer system algebra MuPAD. |
| Starting Page | 75 |
| Ending Page | 85 |
| Page Count | 11 |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://bibliotecadigital.univalle.edu.co/bitstream/10893/1807/1/V.16-No2-p.75-85.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
