{"id":"https://openalex.org/W2164840273","doi":"https://doi.org/10.1145/800141.804682","title":"Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations","display_name":"Two familiar transitive closure algorithms which admit no polynomial time, sublinear space implementations","publication_year":1980,"publication_date":"1980-01-01","ids":{"openalex":"https://openalex.org/W2164840273","doi":"https://doi.org/10.1145/800141.804682","mag":"2164840273"},"language":"en","primary_location":{"id":"doi:10.1145/800141.804682","doi":"https://doi.org/10.1145/800141.804682","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800141.804682","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800141.804682","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/800141.804682","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008676408","display_name":"Martin Tompa","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Martin Tompa","raw_affiliation_strings":["","University of Washington ;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]},{"raw_affiliation_string":"University of Washington ;","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008676408"],"corresponding_institution_ids":["https://openalex.org/I201448701"],"apc_list":null,"apc_paid":null,"fwci":0.601,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65317919,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"333","last_page":"338"},"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.9976000189781189,"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.9976000189781189,"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/T11269","display_name":"Algorithms and Data Compression","score":0.0008999999845400453,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.000699999975040555,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/transitive-closure","display_name":"transitive closure","score":0.9829999804496765},{"id":"https://openalex.org/keywords/boolean-matrix-multiplication","display_name":"Boolean matrix multiplication","score":0.6899999976158142},{"id":"https://openalex.org/keywords/polynomial-time","display_name":"polynomial time","score":0.49799999594688416},{"id":"https://openalex.org/keywords/sublinear-space","display_name":"sublinear space","score":0.9729999899864197},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.4560000002384186}],"concepts":[{"id":"https://openalex.org/C128896722","wikidata":"https://www.wikidata.org/wiki/Q1501387","display_name":"Transitive closure","level":2,"score":0.945077121257782},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.616616427898407},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.6085179448127747},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5867621898651123},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5759588479995728},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5710607767105103},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5277904868125916},{"id":"https://openalex.org/C129691609","wikidata":"https://www.wikidata.org/wiki/Q3088151","display_name":"Transitive reduction","level":5,"score":0.4637855291366577},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.44554296135902405},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4320603609085083},{"id":"https://openalex.org/C191399111","wikidata":"https://www.wikidata.org/wiki/Q64861","display_name":"Transitive relation","level":2,"score":0.4320406913757324},{"id":"https://openalex.org/C163561899","wikidata":"https://www.wikidata.org/wiki/Q1994977","display_name":"Logical matrix","level":3,"score":0.43060487508773804},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.41572582721710205},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39872443675994873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3540992736816406},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.06100437045097351},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.05965161323547363},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/800141.804682","doi":"https://doi.org/10.1145/800141.804682","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800141.804682","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800141.804682","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/800141.804682","doi":"https://doi.org/10.1145/800141.804682","is_oa":true,"landing_page_url":"https://doi.org/10.1145/800141.804682","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/800141.804682","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2164840273.pdf","grobid_xml":"https://content.openalex.org/works/W2164840273.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W1491816185","https://openalex.org/W1573852122","https://openalex.org/W1655990431","https://openalex.org/W1979641885","https://openalex.org/W1983266860","https://openalex.org/W2043843644","https://openalex.org/W2044997054","https://openalex.org/W2061739322","https://openalex.org/W2063264061","https://openalex.org/W2066161457","https://openalex.org/W2081926325","https://openalex.org/W2088956149","https://openalex.org/W2104734478","https://openalex.org/W2119106791","https://openalex.org/W2126370441","https://openalex.org/W2134224523","https://openalex.org/W2142979436","https://openalex.org/W2144599263","https://openalex.org/W3198160809"],"related_works":["https://openalex.org/W2054633003","https://openalex.org/W2074417767","https://openalex.org/W1965216219","https://openalex.org/W115529094","https://openalex.org/W2070992781","https://openalex.org/W2148411689","https://openalex.org/W7099386873","https://openalex.org/W1994373792","https://openalex.org/W2745053196","https://openalex.org/W2545919726"],"abstract_inverted_index":{"Any":[0],"Boolean":[1,12],"straight-line":[2],"program":[3],"which":[4,39],"computes":[5],"the":[6,25,32],"transitive":[7,77],"closure":[8,78],"of":[9,35,75],"an":[10],"nxn":[11],"matrix":[13],"by":[14],"successive":[15],"squaring":[16],"requires":[17,80],"time":[18,44,63],"exceeding":[19],"any":[20,73],"polynomial":[21,43,62],"in":[22,61],"n":[23],"if":[24],"space":[26,53,66],"used":[27],"is":[28,31,69],"o(n).":[29],"This":[30],"first":[33],"demonstration":[34],"a":[36,42,49],"\u201cnatural\u201d":[37],"algorithm":[38,79],"(1)":[40],"has":[41,48,57],"implementation":[45,59,74],"and":[46,64],"(2)":[47],"small":[50,65],"(e.g.,":[51],"O(log2n))":[52],"implementation,":[54],"but":[55],"(3)":[56],"no":[58],"running":[60],"simultaneously.":[67],"It":[68],"also":[70],"shown":[71],"that":[72],"Warshall's":[76],"\u03a9(n)":[81],"space.":[82]},"counts_by_year":[],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}