American Mathematical Society

My Account · My Cart · Customer Services · FAQ  
AMS eContent Search Results
Matches for: msc=(52A25) AND publication=(mcom)
Sort order: Date
Format: Standard display

  
Results: 1 to 3 of 3 found      Go to page: 1

[1] Ted Speevak. An efficient algorithm for obtaining the volume of a special kind of pyramid and application to convex polyhedra . Math. Comp. 46 (1986) 531-536. MR 829623.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[2] A. J. W. Duijvestijn and P. J. Federico. The number of polyhedral ($3$-connected planar) graphs . Math. Comp. 37 (1981) 523-532. MR 628713.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge

[3] Don R. Wilhelmsen. A nearest point algorithm for convex polyhedral cones and applications to positive linear approximation . Math. Comp. 30 (1976) 48-57. MR 0394439.
Abstract, references, and article information   
View Article: PDF
This article is available free of charge


Results: 1 to 3 of 3 found      Go to page: 1