{"id":"https://openalex.org/W1603021901","doi":"https://doi.org/10.1007/978-3-540-74456-6_49","title":"Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument","display_name":"Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument","publication_year":2007,"publication_date":"2007-08-14","ids":{"openalex":"https://openalex.org/W1603021901","doi":"https://doi.org/10.1007/978-3-540-74456-6_49","mag":"1603021901"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-74456-6_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74456-6_49","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051292203","display_name":"Rahul Tripathi","orcid":"https://orcid.org/0000-0001-5587-0888"},"institutions":[{"id":"https://openalex.org/I2613432","display_name":"University of South Florida","ror":"https://ror.org/032db5x82","country_code":"US","type":"education","lineage":["https://openalex.org/I2613432"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Rahul Tripathi","raw_affiliation_strings":["Department of Computer Science and Engineering, University of South Florida, Tampa, FL 33620, USA","Department of Computer Science & Engineering, University of South Florida, Tampa, FL#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of South Florida, Tampa, FL 33620, USA","institution_ids":["https://openalex.org/I2613432"]},{"raw_affiliation_string":"Department of Computer Science & Engineering, University of South Florida, Tampa, FL#TAB#","institution_ids":["https://openalex.org/I2613432"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5051292203"],"corresponding_institution_ids":["https://openalex.org/I2613432"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13110125,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"548","last_page":"558"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.64751136302948},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.543212354183197},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5271767377853394},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5039276480674744},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4920055568218231},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.48596227169036865},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4793285131454468},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.477947473526001},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4484453797340393},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.42720791697502136},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4180842638015747},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.365095853805542},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2679731845855713}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.64751136302948},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.543212354183197},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5271767377853394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5039276480674744},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4920055568218231},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.48596227169036865},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4793285131454468},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.477947473526001},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4484453797340393},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.42720791697502136},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4180842638015747},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.365095853805542},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2679731845855713},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-74456-6_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-74456-6_49","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.99.528","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.528","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.csee.usf.edu/~tripathi/Publication/locally-random-conference.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W236281116","https://openalex.org/W1594962164","https://openalex.org/W1596412683","https://openalex.org/W1631356911","https://openalex.org/W1668966671","https://openalex.org/W1839137787","https://openalex.org/W1996839061","https://openalex.org/W2000211775","https://openalex.org/W2012882416","https://openalex.org/W2019578639","https://openalex.org/W2023906228","https://openalex.org/W2025038680","https://openalex.org/W2030773557","https://openalex.org/W2037426925","https://openalex.org/W2048635696","https://openalex.org/W2059123783","https://openalex.org/W2082647621","https://openalex.org/W2086653003","https://openalex.org/W2097206148","https://openalex.org/W2111824166","https://openalex.org/W2120282110","https://openalex.org/W2123056342","https://openalex.org/W2129261735","https://openalex.org/W2148352980","https://openalex.org/W2158764863","https://openalex.org/W2164284862","https://openalex.org/W2293988196","https://openalex.org/W2608762075","https://openalex.org/W2764347725","https://openalex.org/W2913222977","https://openalex.org/W3004537778","https://openalex.org/W3023447009","https://openalex.org/W3037725046","https://openalex.org/W3103450999","https://openalex.org/W3103511209","https://openalex.org/W4230909286","https://openalex.org/W4238262801","https://openalex.org/W4256317935"],"related_works":["https://openalex.org/W3212703233","https://openalex.org/W1513451900","https://openalex.org/W4288641573","https://openalex.org/W2907393545","https://openalex.org/W2962784854","https://openalex.org/W2328371232","https://openalex.org/W4387560420","https://openalex.org/W1481287275","https://openalex.org/W1909384579","https://openalex.org/W2552400174"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}