Discrete Comput Geom 19:373–Discrete - Computational geometry - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2008-10-16 12:11:14 Discrete geometry Convex analysis Euclidean plane geometry K-set Crossing number Convex hull Convex function Arrangement of lines Pseudotriangle Mathematics Geometry Discrete mathematics		Discrete Comput Geom 19:373–Discrete & Computational Geometry Add to Reading List Source URL: www.cs.duke.edu Download Document from Source Website File Size: 111,63 KB Share Document on Facebook

	Understanding Resolution Proofs through Herbrand’s Theorem‹ Stefan Hetzl1 , Tomer Libal2 , Martin Riener3 , and Mikheil Rukhaia4 1 Institute of Discrete Mathematics and Geometry, Vienna University of Technology DocID: 1xTCQ - View Document
	Sage Reference Manual: Combinatorial and Discrete Geometry Release 8.3 The Sage Development Team DocID: 1vfet - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis III: Algorithms for Discrete Convex Functions Kazuo Murota DocID: 1v6lO - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis I: Concepts of Discrete Convex Functions Kazuo Murota DocID: 1uq8J - View Document
	Hausdorff School: Economics and Tropical Geometry Bonn, May 9-13, 2016 Discrete Convex Analysis II: Properties of Discrete Convex Functions Kazuo Murota DocID: 1uci8 - View Document