SCOPUS 정보 검색 플랫폼

Volumn 30, Issue 3, 2003, Pages 529-544

The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038286479 PISSN: 01968858 EISSN: None Source Type: Journal
DOI: 10.1016/S0196-8858(02)00509-2 Document Type: Article

Times cited : (27)

References (12)

1
- 0001432978
- A lower bound for the volume of strictly convex bodies with many boundary points
- G. Andrews, A lower bound for the volume of strictly convex bodies with many boundary points, Trans. Amer. Math. Soc. 106 (1965) 270-273.
- (1965) Trans. Amer. Math. Soc. , vol.106 , pp. 270-273
- Andrews, G.¹

2
- 0002170343
- Separable partitions
- N. Alon, S. Onn, Separable partitions, Discrete App. Math. 91 (1999) 39-51.
- (1999) Discrete App. Math. , vol.91 , pp. 39-51
- Alon, N.¹ Onn, S.²

3
- 85025490602
- Standard bases and geometric invariant theory
- D. Bayer, I. Morrison, Standard bases and geometric invariant theory, J. Symbolic Comput. 6 (1988) 209-217.
- (1988) J. Symbolic Comput. , vol.6 , pp. 209-217
- Bayer, D.¹ Morrison, I.²

4
- 0001598468
- The number of generators of a colength N ideal in a power series ring
- D. Berman, The number of generators of a colength N ideal in a power series ring, J. Algebra 73 (1981) 156-166.
- (1981) J. Algebra , vol.73 , pp. 156-166
- Berman, D.¹

5
- 25944479355
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- J.C. Faugère, P. Gianni, D. Lazard, T. Mora, Efficient computation of zero-dimensional Gröbner bases by change of ordering, J. Symbolic Comput. 16 (1993) 329-344.
- (1993) J. Symbolic Comput. , vol.16 , pp. 329-344
- Faugère, J.C.¹ Gianni, P.² Lazard, D.³ Mora, T.⁴

6
- 0001734192
- Minkowski addition of polytopes: Complexity and applications to Gröbner bases
- P. Gritzmann, B. Sturmfels, Minkowski addition of polytopes: complexity and applications to Gröbner bases, SIAM J. Discrete Math. 6 (1993) 246-269.
- (1993) SIAM J. Discrete Math. , vol.6 , pp. 246-269
- Gritzmann, P.¹ Sturmfels, B.²

7
- 0033271978
- A polynomial time algorithm for shaped partition problems
- F.K. Hwang, S. Onn, U.G. Rothblum, A polynomial time algorithm for shaped partition problems, SIAM J. Optim. 10 (1999) 70-81.
- (1999) SIAM J. Optim. , vol.10 , pp. 70-81
- Hwang, F.K.¹ Onn, S.² Rothblum, U.G.³

8
- 0000408683
- The Gröbner fan of an ideal
- T. Mora, L. Robbiano, The Gröbner fan of an ideal, J. Symbolic Comput. 6 (1988) 183-208.
- (1988) J. Symbolic Comput. , vol.6 , pp. 183-208
- Mora, T.¹ Robbiano, L.²

9
- 0035435181
- The vector partition problem for convex objective functions
- S. Onn, L.J. Schulman, The vector partition problem for convex objective functions, Math. Oper. Res. 26 (2001) 583-590.
- (2001) Math. Oper. Res. , vol.26 , pp. 583-590
- Onn, S.¹ Schulman, L.J.²

10
- 0033164327
- Cutting corners
- S. Onn, B. Sturmfels, Cutting corners, Adv. in Appl. Math. 23 (1999) 29-48.
- (1999) Adv. in Appl. Math. , vol.23 , pp. 29-48
- Onn, S.¹ Sturmfels, B.²

11
- 0000182325
- Gröbner bases of lattices, comer polyhedra, and integer programming
- B. Sturmfels, R. Weismantel, G.M. Ziegler, Gröbner bases of lattices, comer polyhedra, and integer programming, Beiträge Algebra Geom. 36 (1995) 281-298.
- (1995) Beiträge Algebra Geom. , vol.36 , pp. 281-298
- Sturmfels, B.¹ Weismantel, R.² Ziegler, G.M.³

12
- 0036698988
- On the number of corner cuts
- U. Wagner, On the number of corner cuts, Adv. in Appl. Math. 29 (2002) 152-161.
- (2002) Adv. in Appl. Math. , vol.29 , pp. 152-161
- Wagner, U.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.