{"id":"https://openalex.org/W2112852465","doi":"https://doi.org/10.1007/s00037-012-0043-7","title":"Improved direct product theorems for randomized query complexity","display_name":"Improved direct product theorems for randomized query complexity","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2112852465","doi":"https://doi.org/10.1007/s00037-012-0043-7","mag":"2112852465"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-012-0043-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-012-0043-7","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/d59e1f3d-c21b-48c2-ad37-a0991dbb2e93","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037697309","display_name":"Andrew Drucker","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrew Drucker","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5037697309"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.0876,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.87603765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"21","issue":"2","first_page":"197","last_page":"244"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/mathematics","display_name":"Mathematics","score":0.606987714767456},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.597309947013855},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.5590940117835999},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.513785183429718},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.503462016582489},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4837248623371124},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48000091314315796},{"id":"https://openalex.org/keywords/statement","display_name":"Statement (logic)","score":0.47998616099357605},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.47665315866470337},{"id":"https://openalex.org/keywords/direct-product","display_name":"Direct product","score":0.4650149941444397},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4362488389015198},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.43218040466308594},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42694494128227234},{"id":"https://openalex.org/keywords/query-optimization","display_name":"Query optimization","score":0.42560991644859314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2598443627357483},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10439887642860413}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.606987714767456},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.597309947013855},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.5590940117835999},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.513785183429718},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.503462016582489},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4837248623371124},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48000091314315796},{"id":"https://openalex.org/C2777026412","wikidata":"https://www.wikidata.org/wiki/Q2684591","display_name":"Statement (logic)","level":2,"score":0.47998616099357605},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.47665315866470337},{"id":"https://openalex.org/C58193220","wikidata":"https://www.wikidata.org/wiki/Q1778193","display_name":"Direct product","level":2,"score":0.4650149941444397},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4362488389015198},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.43218040466308594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42694494128227234},{"id":"https://openalex.org/C157692150","wikidata":"https://www.wikidata.org/wiki/Q2919848","display_name":"Query optimization","level":2,"score":0.42560991644859314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2598443627357483},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10439887642860413},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"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/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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":4,"locations":[{"id":"doi:10.1007/s00037-012-0043-7","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-012-0043-7","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/d59e1f3d-c21b-48c2-ad37-a0991dbb2e93","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/d59e1f3d-c21b-48c2-ad37-a0991dbb2e93","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Drucker, A 2012, 'Improved direct product theorems for randomized query complexity', Computational complexity, vol. 21, no. 2, pp. 197-244. https://doi.org/10.1007/s00037-012-0043-7","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.ed.ac.uk:publications/08f7fdd6-a6b0-4d8c-b5ef-b418a931e685","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/improved-direct-product-theorems-for-randomized-query-complexity(08f7fdd6-a6b0-4d8c-b5ef-b418a931e685).html","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.ed.ac.uk:publications/d59e1f3d-c21b-48c2-ad37-a0991dbb2e93","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/improved-direct-product-theorems-for-randomized-query-complexity(d59e1f3d-c21b-48c2-ad37-a0991dbb2e93).html","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/d59e1f3d-c21b-48c2-ad37-a0991dbb2e93","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/d59e1f3d-c21b-48c2-ad37-a0991dbb2e93","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Drucker, A 2012, 'Improved direct product theorems for randomized query complexity', Computational complexity, vol. 21, no. 2, pp. 197-244. https://doi.org/10.1007/s00037-012-0043-7","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W82127983","https://openalex.org/W1523387560","https://openalex.org/W1546919981","https://openalex.org/W1559980198","https://openalex.org/W1753012273","https://openalex.org/W1771425335","https://openalex.org/W1793396681","https://openalex.org/W1859250467","https://openalex.org/W1867758558","https://openalex.org/W1989019709","https://openalex.org/W1989274820","https://openalex.org/W2012496360","https://openalex.org/W2013570814","https://openalex.org/W2016201895","https://openalex.org/W2021736779","https://openalex.org/W2038435918","https://openalex.org/W2042753471","https://openalex.org/W2068911609","https://openalex.org/W2074456199","https://openalex.org/W2099248542","https://openalex.org/W2101593059","https://openalex.org/W2104549991","https://openalex.org/W2123540893","https://openalex.org/W2126244834","https://openalex.org/W2129700748","https://openalex.org/W2138852390","https://openalex.org/W2148211896","https://openalex.org/W2158554251","https://openalex.org/W2160403361","https://openalex.org/W2167217679","https://openalex.org/W2169523978","https://openalex.org/W2205302211","https://openalex.org/W2294870549","https://openalex.org/W2913555003","https://openalex.org/W3101653183","https://openalex.org/W3102306714","https://openalex.org/W3157388067","https://openalex.org/W3172945542"],"related_works":["https://openalex.org/W3006682748","https://openalex.org/W1097487277","https://openalex.org/W2768610039","https://openalex.org/W4308265086","https://openalex.org/W2949964783","https://openalex.org/W2106889256","https://openalex.org/W2801357573","https://openalex.org/W2982363256","https://openalex.org/W1509719224","https://openalex.org/W1948038071"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}