Back to Results
First PageMeta Content
Operations research / Linear programming / Convex optimization / Convex analysis / Computational geometry / Polyhedral combinatorics / Ellipsoid method / Convex polytope / Combinatorics / Mathematics / Mathematical optimization / Geometry


Geometrie Algorithms and Algorithmic Geometry Lâszlo Lovâsz Department of Computer Science, Eötvös University, H-1088 Budapest, Hungary and
Add to Reading List

Document Date: 2012-04-18 10:48:30


Open Document

File Size: 1,99 MB

Share Result on Facebook

City

Kyoto / Budapest / /

Company

Ford / /

Country

Hungary / Japan / United States / /

Facility

Princeton University / Eötvös University / S stable / /

IndustryTerm

polynomial-time solutions / polynomial algorithm / polynomial time algorithms / e-tolerance / geometric algorithms / binary search / polynomial time algorithm / image processing / celebrated linear programming algorithm / polynomial time solution / polynomial-time algorithm / computing / separation algorithm / violation algorithm / /

MusicAlbum

YES / /

Organization

Eötvös University / International Congress / Department of Computer Science / Mathematical Society of Jaoan / Geometrie Algorithms and Algorithmic Geometry Lâszlo Lovâsz Department of Computer Science / Princeton University / /

Person

John Ellipsoid It / /

ProvinceOrState

New Jersey / /

Technology

geometric Geometrie Algorithms / violation algorithm / cryptography / s/n / polynomial time algorithm / 1991 140 Lâszlo Lovâsz algorithms / polynomial-time algorithm / celebrated linear programming algorithm / separation algorithm / polynomial time algorithms / image processing / polynomial algorithm / Geometrie Algorithms / /

SocialTag