{"id":"https://openalex.org/W2803418903","doi":"https://doi.org/10.1145/3188745.3188938","title":"More consequences of falsifying SETH and the orthogonal vectors conjecture","display_name":"More consequences of falsifying SETH and the orthogonal vectors conjecture","publication_year":2018,"publication_date":"2018-06-20","ids":{"openalex":"https://openalex.org/W2803418903","doi":"https://doi.org/10.1145/3188745.3188938","mag":"2803418903"},"language":"en","primary_location":{"id":"doi:10.1145/3188745.3188938","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3188745.3188938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1805.08554","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Amir Abboud","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Amir Abboud","raw_affiliation_strings":["IBM Research, USA"],"affiliations":[{"raw_affiliation_string":"IBM Research, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":null,"display_name":"Karl Bringmann","orcid":null},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Karl Bringmann","raw_affiliation_strings":["Max Planck Institute for Informatics, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Holger Dell","orcid":null},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Holger Dell","raw_affiliation_strings":["Saarland University, Germany / M2CI, Germany"],"affiliations":[{"raw_affiliation_string":"Saarland University, Germany / M2CI, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":null,"display_name":"Jesper Nederlof","orcid":null},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Jesper Nederlof","raw_affiliation_strings":["Eindhoven University of Technology, Netherlands"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2799,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.8191305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"253","last_page":"266"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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/T11130","display_name":"Coding theory and cryptography","score":0.9994000196456909,"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/conjecture","display_name":"Conjecture","score":0.7631999850273132},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6725999712944031},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5167999863624573},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4359999895095825},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.42419999837875366}],"concepts":[{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7631999850273132},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7358999848365784},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6725999712944031},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6345000267028809},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5167999863624573},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49309998750686646},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4359999895095825},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.42419999837875366},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.3276999890804291},{"id":"https://openalex.org/C153046414","wikidata":"https://www.wikidata.org/wiki/Q12482","display_name":"Set theory","level":3,"score":0.2800000011920929}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3188745.3188938","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3188745.3188938","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/3806796c-ad59-4b4c-a424-0eca9bc3e866","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/3806796c-ad59-4b4c-a424-0eca9bc3e866","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abboud, A, Dell, H, Bringmann, K & Nederlof, J 2018, More consequences of falsifying SETH and the orthogonal vectors conjecture. in M Henzinger, D Kempe & I Diakonikolas (eds), STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, Inc., New York, pp. 253-266, 50th Annual ACM Symposium on Theory of Computing, STOC 2018, Los Angeles, United States, 25/06/18. https://doi.org/10.1145/3188745.3188938","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1805.08554","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1805.08554","pdf_url":"https://arxiv.org/pdf/1805.08554","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:pure.tue.nl:publications/3806796c-ad59-4b4c-a424-0eca9bc3e866","is_oa":false,"landing_page_url":"https://dblp.org/db/conf/stoc/stoc2018.html#AbboudBDN18","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abboud, A, Dell, H, Bringmann, K & Nederlof, J 2018, More consequences of falsifying SETH and the orthogonal vectors conjecture. in M Henzinger, D Kempe & I Diakonikolas (eds), STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, Inc., New York, pp. 253-266, 50th Annual ACM Symposium on Theory of Computing, STOC 2018, Los Angeles, United States, 25/06/18. https://doi.org/10.1145/3188745.3188938","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:tue:oai:pure.tue.nl:publications/3806796c-ad59-4b4c-a424-0eca9bc3e866","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/3806796c-ad59-4b4c-a424-0eca9bc3e866","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 253 - 266","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1805.08554","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1805.08554","pdf_url":"https://arxiv.org/pdf/1805.08554","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W33016721","https://openalex.org/W1556385097","https://openalex.org/W1764956874","https://openalex.org/W1787126581","https://openalex.org/W1950402288","https://openalex.org/W1968952709","https://openalex.org/W1973046087","https://openalex.org/W1973113631","https://openalex.org/W1985572324","https://openalex.org/W2047489708","https://openalex.org/W2050715481","https://openalex.org/W2055693471","https://openalex.org/W2059273723","https://openalex.org/W2064790310","https://openalex.org/W2083820240","https://openalex.org/W2084732238","https://openalex.org/W2089256463","https://openalex.org/W2098207812","https://openalex.org/W2102477571","https://openalex.org/W2109797885","https://openalex.org/W2121770144","https://openalex.org/W2146507303","https://openalex.org/W2159892713","https://openalex.org/W2207058206","https://openalex.org/W2226187912","https://openalex.org/W2404196336","https://openalex.org/W2404960361","https://openalex.org/W2547063853","https://openalex.org/W2625217561","https://openalex.org/W2803418903","https://openalex.org/W2964091527","https://openalex.org/W4205778826","https://openalex.org/W4213071546"],"related_works":[],"abstract_inverted_index":{"The":[0,28],"Strong":[1],"Exponential":[2],"Time":[3],"Hypothesis":[4],"and":[5],"the":[6,23],"OV-conjecture":[7,29],"are":[8],"two":[9],"popular":[10],"hardness":[11],"assumptions":[12],"used":[13],"to":[14],"prove":[15],"a":[16,50,56],"plethora":[17],"of":[18,25,52,59],"lower":[19],"bounds,":[20],"especially":[21],"in":[22,30,55],"realm":[24],"polynomial-time":[26],"algorithms.":[27],"moderate":[31],"dimension":[32],"states":[33],"there":[34,48],"is":[35,49],"no":[36],"\u03b5>0":[37],"for":[38],"which":[39],"an":[40],"O(N2\u2212\u03b5)":[41],"poly(D)":[42],"time":[43],"algorithm":[44],"can":[45],"decide":[46],"whether":[47],"pair":[51],"orthogonal":[53],"vectors":[54],"given":[57],"set":[58],"size":[60],"N":[61],"that":[62],"contains":[63],"D-dimensional":[64],"binary":[65],"vectors.":[66]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2018-06-01T00:00:00"}