English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Intersecting two polyhedra one of which is convex

Mehlhorn, K., & Simon, K. (1985). Intersecting two polyhedra one of which is convex. In FCT '85: Fundamentals of Computation Theory (pp. 534-542). Berlin, Germany: Springer.

Item is

Files

show Files
hide Files
:
Mehlhorn48.pdf (Publisher version), 384KB
 
File Permalink:
-
Name:
Mehlhorn48.pdf
Description:
-
OA-Status:
Visibility:
Private
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Simon, Klaus2, Author
Budach, Lothar2, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
2Max Planck Society, ou_persistent13              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2008-01-181985
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin, Germany : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344606
Other: Local-ID: C1256428004B93B8-93E66CE9259795CDC12571B200317983-mehlhorn85h
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Cottbus, GDR
Start-/End Date: 1985-09-09

Legal Case

show

Project information

show

Source 1

show
hide
Title: FCT '85: Fundamentals of Computation Theory
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 534 - 542 Identifier: ISBN: 3-540-15689-5

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: -