First Page | Meta Content | |
---|---|---|
Document Date: 2008-03-13 15:36:52Open Document File Size: 347,14 KBShare Result on FacebookCityIEEE / /CompanyIBM / 3SAT / /CountryIsrael / /CurrencyUSD / / /FacilityNP SANJEEV ARORA Princeton University / Jersey AND SHMUEL SAFRA Tel-Aviv University / Stanford University / Tel-Aviv University / /IndustryTermpolynomial-time algorithms / subexponential-time algorithms / cryptographic applications / approximation algorithm / interactive proof systems / polynomial-time algorithm / good approximation algorithms / approximate solutions / /OrganizationMath Department / National Science Foundation / CS Division / Stanford University / UC Berkeley / SHMUEL SAFRA Tel-Aviv University / Tel-Aviv / Princeton University / Tel-Aviv University / Tel-Aviv / Association for Computing Machinery / /PersonSANJEEV ARORA / SHMUEL SAFRA / /PositionMathematical Logic General / /ProvinceOrStateNew Jersey / New York / /PublishedMediumJournal of the ACM / /SportsLeagueStanford University / /Technologysubexponential-time algorithms / approximation algorithm / polynomial-time algorithms / polynomial-time algorithm / Approximation algorithms / random access / good approximation algorithms / /SocialTag |