Vote for your favorite mineral in #MinCup25! - Pollucite vs. Tugtupite
It's the cesium #pollucite against the optical changeling #tugtupite for this match.
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Dyer, Martin, Gritzmann, Peter, Hufnagel, Alexander (1998) On The Complexity of Computing Mixed Volumes. SIAM Journal on Computing, 27 (2). 356-400 doi:10.1137/s0097539794278384

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleOn The Complexity of Computing Mixed Volumes
JournalSIAM Journal on Computing
AuthorsDyer, MartinAuthor
Gritzmann, PeterAuthor
Hufnagel, AlexanderAuthor
Year1998 (April)Volume27
Issue2
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539794278384Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240186Long-form Identifiermindat:1:5:11240186:7
GUID0
Full ReferenceDyer, Martin, Gritzmann, Peter, Hufnagel, Alexander (1998) On The Complexity of Computing Mixed Volumes. SIAM Journal on Computing, 27 (2). 356-400 doi:10.1137/s0097539794278384
Plain TextDyer, Martin, Gritzmann, Peter, Hufnagel, Alexander (1998) On The Complexity of Computing Mixed Volumes. SIAM Journal on Computing, 27 (2). 356-400 doi:10.1137/s0097539794278384
In(1998, April) SIAM Journal on Computing Vol. 27 (2) Society for Industrial & Applied Mathematics (SIAM)

See Also

These are possibly similar items as determined by title/reference text matching only.

Dyer, Martin, Goldberg, Leslie Ann, Jerrum, Mark (2009) The Complexity of Weighted Boolean #CSP. SIAM Journal on Computing, 38 (5). 1970-1986 doi:10.1137/070690201
Bubley, Russ, Dyer, Martin, Greenhill, Catherine, Jerrum, Mark (1999) On Approximately Counting Colorings of Small Degree Graphs. SIAM Journal on Computing, 29 (2). 387-400 doi:10.1137/s0097539798338175
Gritzmann, Peter, Habsieger, Laurent, Klee, Victor (1991) Good and Bad Radii of Convex Polygons. SIAM Journal on Computing, 20 (2). 395-403 doi:10.1137/0220024
Dyer, M. E., Frieze, A. M. (1988) On the Complexity of Computing the Volume of a Polyhedron. SIAM Journal on Computing, 17 (5). 967-974 doi:10.1137/0217060
Dyer, Martin, Frieze, Alan, Jerrum, Mark (1998) Approximately Counting Hamilton Paths and Cycles in Dense Graphs. SIAM Journal on Computing, 27 (5). 1262-1272 doi:10.1137/s009753979426112x
Grigoriev, Dima, Karpinski, Marek (1998) Computing the Additive Complexity of Algebraic Circuits with Root Extracting. SIAM Journal on Computing, 27 (3). 694-701 doi:10.1137/s0097539793258313
Goldreich, Oded, Ostrovsky, Rafail, Petrank, Erez (1998) Computational Complexity and Knowledge Complexity. SIAM Journal on Computing, 27 (4). 1116-1141 doi:10.1137/s0097539795280524
Grandjean, Etienne (1984) The Spectra of First-Order Sentences and Computational Complexity. SIAM Journal on Computing, 13 (2). 356-373 doi:10.1137/0213025
Dyer, Martin (1991) On Counting Lattice Points in Polyhedra. SIAM Journal on Computing, 20 (4). 695-707 doi:10.1137/0220044
Beals, Robert, Nishino, Tetsuro, Tanaka, Keisuke (1998) On the Complexity of Negation-Limited Boolean Networks. SIAM Journal on Computing, 27 (5). 1334-1347 doi:10.1137/s0097539794275136
Bürgisser, Peter (2000) The Computational Complexity of Immanants. SIAM Journal on Computing, 30 (3). 1023-1040 doi:10.1137/s0097539798367880
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 8, 2025 07:44:34
Go to top of page