Back to Results
First PageMeta Content
Complexity classes / TFNP / FNP / NP / PPA / FP / Complete / PLS / P versus NP problem / Theoretical computer science / Computational complexity theory / Applied mathematics


Note On total functions, existence
Add to Reading List

Document Date: 2004-06-22 14:05:33

Open Document

File Size: 128,14 KB

Share Result on Facebook

City

Berlin / Los Angeles / Amsterdam / Patras / San Jose / /

Company

IBM / Elsevier Science Publishers B.V. / ESPRIT / /

Country

United States / Netherlands / Greece / /

Currency

USD / /

Facility

IBM Almaden Research Center / Tel Aviv University / Israel Christos H. Papadimitriou* Computer Technology Institute / University of California / /

IndustryTerm

polynomial local search problems / basic feasible solution / feasible solution / local search / local search problems / polynomial-time algorithm / local search heuristic / wh computing / /

Organization

University of California / National Science Foundation / Nimrod Megiddo IBM Almaden Research Center / Volkswagen Foundation / Israel Christos H. Papadimitriou* Computer Technology Institute / Tel Aviv University / Tel Aviv / /

Person

Nimrod Megiddo / Lin Alg / Christos H. Papadimitriou / /

Position

salesman / Player / /

ProgrammingLanguage

C / TSP / /

ProvinceOrState

California / /

PublishedMedium

Theoretical Computer Science / /

Technology

polynomial-time algorithm / /

SocialTag