First Page | Meta Content | |
---|---|---|
Document Date: 2010-05-13 09:39:02Open Document File Size: 225,37 KBShare Result on FacebookCityLas Vegas / Independence Way Princeton / Boston / /CompanyOracle / Cobham / /CountryUnited States / Soviet Union / Sudan / /CurrencyUSD / / /EventFDA Phase / /FacilityComputational Complexity Lance Fortnow∗ NEC Research Institute / Moscow State University / Steve Homer† Computer Science Department Boston University / Clay Mathematics Institute / /IndustryTermpropositional proof systems / polynomial-time approximation algorithm / probabilistic algorithm / possible solution / deterministic polynomial-time algorithm / probabilistic algorithms / interactive proof systems / approximate solution / brute force search / polynomial time solution / computational device / deterministic algorithm / computing / proof systems / polynomialtime algorithm / Zero-knowledge proof systems / approximation algorithms / /OrganizationMoscow State University / National Science Foundation / Harvard / Clay Mathematics Institute / Computational Complexity Lance Fortnow∗ NEC Research Institute / Boston University / /PersonRabin / Richard Karp / Leonid Levin / Mansour / Stephen Cook / / /Positiontraveling salesman / tape head / theoretical model for computation / salesman / /ProductBabai / BM88 / /ProvinceOrStateNew Jersey / New Foundland and Labrador / Massachusetts / /Technologypolynomial-time approximation algorithm / cryptography / 8 This algorithm / usually using approximation algorithms / deterministic algorithm / Solovay-Strassen algorithm / approximation algorithms / polynomialtime algorithm / deterministic polynomial-time algorithm / /URLhttp /SocialTag |