First Page | Meta Content | |
---|---|---|
![]() | Document Date: 2009-04-13 10:34:31Open Document File Size: 99,82 KBShare Result on FacebookCityBerlin / Zaragoza / /CompanyCobham / /CountrySudan / /CurrencyUSD / / /FacilityClay Institute / /IndustryTermpropositional proof systems / quantum computing complexity classes / cryptographic protocols / efficient solution / efficient algorithm / term algorithm / verification algorithm / possible solution / probabilistic algorithms / polynomial time algorithm / verification algorithms / feasible algorithm / brute force search / regular polynomial-time algorithm / Typical tools / possible solutions / exhaustive search / Approximation algorithms / /MusicGroupTuring Machine / the Random / /OrganizationClay Institute / Sistemas Universidad de Zaragoza Mar´ıa de Luna / /PersonLance Fortnow / Elvira Mayordomo Departamento de Inform / /Position≤pm / researcher / reductions ≤pm / /ProvinceOrStatePennsylvania / /PublishedMediumJournal of the ACM / /Technologyregular polynomial-time algorithm / cryptography / efficient algorithm / corresponding verification algorithm / polynomial time algorithm / verification algorithms / verification algorithm / term algorithm / Approximation algorithms / Random Access / feasible algorithm / /SocialTag |