English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Complexity of Some Polyhedral Enumeration Problems

Tiwary, H. R. (2008). Complexity of Some Polyhedral Enumeration Problems. PhD Thesis, Universität des Saarlandes, Saarbrücken.

Item is

Files

show Files

Locators

show
hide
Description:
-
OA-Status:
Green
Locator:
http://scidok.sulb.uni-saarland.de/doku/lic_ohne_pod.php?la=de (Copyright transfer agreement)
Description:
-
OA-Status:
Not specified

Creators

show
hide
 Creators:
Tiwary, Hans Raj1, 2, Author           
Seidel, Reimund3, Advisor
Mehlhorn, Kurt1, Referee           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2International Max Planck Research School, MPI for Informatics, Max Planck Society, Campus E1 4, 66123 Saarbrücken, DE, ou_1116551              
3External Organizations, ou_persistent22              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2009-04-062008-12-2220082008
 Publication Status: Issued
 Pages: -
 Publishing info: Saarbrücken : Universität des Saarlandes
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 428325
Other: Local-ID: C125756E0038A185-36EBC8AB2127C36FC125759000266574-TiwaryPhD08
 Degree: PhD

Event

show

Legal Case

show

Project information

show

Source

show