Back to Results
First PageMeta Content
NP-complete problems / Vertex / Graph / Degeneracy / Connected component / Connectivity / Shortest path problem / Tree / Routing algorithms / Graph theory / Mathematics / Theoretical computer science


Potential theory for mean payo games Yury Lifshits* and Dmitri Pavlov Laboratory of Mathematical Logic, Saint Petersburg Department of Steklov Mathematical Institute; and Department of Mathematics, Institute of Fine Mec
Add to Reading List

Document Date: 2008-11-06 22:14:54

Open Document

File Size: 158,98 KB

Share Result on Facebook

City

Berlin / /

Company

Vertex / /

/

Facility

Steklov Mathematical Institute / Institute of Fine Mechanics / Dmitri Pavlov Laboratory of Mathematical Logic / /

IndustryTerm

potential computing / degenerate solutions / feasible solution / subexponential strategy improvement algorithm / binary search / polynomial time algorithm / important applications / cient algorithms / deterministic algorithm / sparse networks / erent pseudopolynomial algorithms / rst search / /

Organization

Institute of Fine Mechanics and Optics / Saint Petersburg Department of Steklov Mathematical Institute / Department of Mathematics / /

Person

Mike Paterson / Bob / Kurt Mehlhorn / Alice / Dexter Kozen / Sven Sandberg / Henrik Bj / Sergei Vorobyov / Stephen Kwek / Uri Zwick / Donald B. Johnson / Hartmut Klauck / Alexander Schrijver / Hotst Reichel / Sophie Tison / X. Compute / Yury Lifshits / /

Position

rst author / player / /

PublishedMedium

Journal of the ACM / Theoretical Computer Science / Lecture Notes in Computer Science / /

Technology

cient algorithms / polynomial time algorithm / 4 The algorithm / strongly subexponential strategy improvement algorithm / erent pseudopolynomial algorithms / /

SocialTag