Faster multi-witnesses for Boolean matrix multiplication
Uloženo v:
| Vydáno v: | Information processing letters Ročník 109; číslo 4; s. 242 - 247 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Amsterdam
Elsevier B.V
2009
Elsevier |
| Témata: | |
| ISSN: | 0020-0190, 1872-6119 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Author | Lingas, Andrzej Gąsieniec, Leszek Kowaluk, Mirosław |
|---|---|
| Author_xml | – sequence: 1 givenname: Leszek surname: Gąsieniec fullname: Gąsieniec, Leszek email: L.A.Gasieniec@liverpool.ac.uk organization: Department of Computer Science, University of Liverpool, L69 3BX Liverpool, United Kingdom – sequence: 2 givenname: Mirosław surname: Kowaluk fullname: Kowaluk, Mirosław email: kowaluk@mimuw.edu.pl organization: Institute of Informatics, Warsaw University, Warsaw, Poland – sequence: 3 givenname: Andrzej surname: Lingas fullname: Lingas, Andrzej email: Andrzej.Lingas@cs.lth.se organization: Department of Computer Science, Lund University, 22100 Lund, Sweden |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21189816$$DView record in Pascal Francis |
| BookMark | eNp9kU9v1DAQxS1UJLalH4DbXjhm60lixxEnqOgfqVIvcB5NnInqlTeObC-Fb4-XUA4cehp59H7zrPfOxdkcZhbiA8gdSNBX-51b_K6W0pT3TkL9RmzAdHWlAfozsZGylpWEXr4T5yntpZS6bbqNMDeUMsft4eizq55dnjklTtspxO2XEDzTvD1Qju7nKlm8s5RdmN-LtxP5xJd_54X4fvP12_Vd9fB4e3_9-aGyLXS5MnaCSY26g1FBp6npNbcNsR4MDbYjO4ytIsUdGNtOQ6-sbAwPI_Q1a8tjcyFovZueeTkOuER3oPgLAzlcQszkMXJiivYJ_RETY1G9fDIha9n3YBROo26w1VKhmboaa9tSCatlJVXx-Lh6LJQs-SnSbF36Z1UDmN6ALrpu1dkYUoo8oXX5j1GO5DyCxFMZuMeSE57KOK1KGYWE_8iX468xn1aGS7w_HEdM1vFcQnGRbcYxuFfo31klpeo |
| CODEN | IFPLAT |
| CitedBy_id | crossref_primary_10_3390_a7020243 crossref_primary_10_1007_s00453_018_0492_8 crossref_primary_10_1137_18M1210459 crossref_primary_10_1007_s00453_022_01063_2 crossref_primary_10_1016_j_tcs_2018_10_028 |
| Cites_doi | 10.1007/978-3-540-75520-3_25 10.1016/S0747-7171(08)80013-2 10.1006/jcom.1998.0476 10.1007/BF01940874 10.1007/978-3-540-75520-3_62 10.1016/j.tcs.2007.02.053 |
| ContentType | Journal Article |
| Copyright | 2008 Elsevier B.V. 2009 INIST-CNRS |
| Copyright_xml | – notice: 2008 Elsevier B.V. – notice: 2009 INIST-CNRS |
| DBID | AAYXX CITATION IQODW ADTPV AOWAS D95 |
| DOI | 10.1016/j.ipl.2008.10.012 |
| DatabaseName | CrossRef Pascal-Francis SwePub SwePub Articles SWEPUB Lunds universitet |
| DatabaseTitle | CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science Applied Sciences Mathematics |
| EISSN | 1872-6119 |
| EndPage | 247 |
| ExternalDocumentID | oai_portal_research_lu_se_publications_e6099185_fd63_4605_8f72_2c4a0084e505 21189816 10_1016_j_ipl_2008_10_012 S002001900800327X |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD AEBSH AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 E.L EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HMJ HVGLF HZ~ IHE J1W KOM LG9 M26 M41 MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SEW SME SPC SPCBC SSV SSZ T5K TN5 UQL WH7 WUQ XPP ZMT ZY4 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD AFXIZ AGCQF AGRNS BNPGV IQODW SSH ADTPV AOWAS D95 |
| ID | FETCH-LOGICAL-c417t-8cf1f5d671d5176a396e43ae6b8abc7acbd45a5e718c4fb95c038ebd192e6ced3 |
| ISICitedReferencesCount | 13 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000262892600007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0020-0190 |
| IngestDate | Wed Oct 15 11:38:29 EDT 2025 Mon Jul 21 09:13:34 EDT 2025 Tue Nov 18 21:53:47 EST 2025 Sat Nov 29 03:44:16 EST 2025 Fri Feb 23 02:30:03 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | Time complexity, directed acyclic graph (dag) Algorithms Lowest common ancestors in dags Combinatorial problems Witnesses for Boolean matrix product Boolean matrix multiplication Analysis of algorithms Computer theory Boolean matrix Combinatorial problem directed acyclic graph (dag); Lowest common ancestors in dags; Algorithms; Analysis of algorithms; Combinatorial problems Matrix product Algorithm Boolean matrix multiplication; Witnesses for Boolean matrix product; Time complexity Information processing Digraph Time complexity Acyclic graph Algorithm analysis Directed graph |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 CC BY 4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c417t-8cf1f5d671d5176a396e43ae6b8abc7acbd45a5e718c4fb95c038ebd192e6ced3 |
| PageCount | 6 |
| ParticipantIDs | swepub_primary_oai_portal_research_lu_se_publications_e6099185_fd63_4605_8f72_2c4a0084e505 pascalfrancis_primary_21189816 crossref_citationtrail_10_1016_j_ipl_2008_10_012 crossref_primary_10_1016_j_ipl_2008_10_012 elsevier_sciencedirect_doi_10_1016_j_ipl_2008_10_012 |
| PublicationCentury | 2000 |
| PublicationDate | 2009 |
| PublicationDateYYYYMMDD | 2009-01-01 |
| PublicationDate_xml | – year: 2009 text: 2009 |
| PublicationDecade | 2000 |
| PublicationPlace | Amsterdam |
| PublicationPlace_xml | – name: Amsterdam |
| PublicationTitle | Information processing letters |
| PublicationYear | 2009 |
| Publisher | Elsevier B.V Elsevier |
| Publisher_xml | – name: Elsevier B.V – name: Elsevier |
| References | Czumaj, Kowaluk, Lingas (bib006) 2007; 380 Alon, Naor (bib001) 1996; 16 S. Eckhardt, A. Mühling, J. Nowak, Fast lowest common ancestor computations in dags, in: Proc. of ESA 2007, 2007, pp. 705–716 Coppersmith, Winograd (bib004) 1990; 9 Galil, Margalit (bib008) 1993 P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, in: Proc. 13th Symposium on Discrete Algorithms (SODA), 2002, pp. 697–704 Aumann, Lewenstein, Lewenstein, Tsur (bib002) 2007; vol. 4580 Huang, Pan (bib009) 1998; 14 Coppersmith (bib003) 1997; 13 M. Kowaluk, A. Lingas, Unique lowest common ancestors in dags are almost as easy as matrix multiplication, in: Proc. of ESA 2007, 2007, pp. 265–274 Huang (10.1016/j.ipl.2008.10.012_bib009) 1998; 14 Aumann (10.1016/j.ipl.2008.10.012_bib002) 2007; vol. 4580 Czumaj (10.1016/j.ipl.2008.10.012_bib006) 2007; 380 10.1016/j.ipl.2008.10.012_bib010 Galil (10.1016/j.ipl.2008.10.012_bib008) 1993 Coppersmith (10.1016/j.ipl.2008.10.012_bib003) 1997; 13 Coppersmith (10.1016/j.ipl.2008.10.012_bib004) 1990; 9 10.1016/j.ipl.2008.10.012_bib005 Alon (10.1016/j.ipl.2008.10.012_bib001) 1996; 16 10.1016/j.ipl.2008.10.012_bib007 |
| References_xml | – volume: 14 start-page: 257 year: 1998 end-page: 299 ident: bib009 article-title: Fast rectangular matrix multiplications and applications publication-title: Journal of Complexity – reference: M. Kowaluk, A. Lingas, Unique lowest common ancestors in dags are almost as easy as matrix multiplication, in: Proc. of ESA 2007, 2007, pp. 265–274 – volume: 9 start-page: 251 year: 1990 end-page: 280 ident: bib004 article-title: Matrix multiplication via arithmetic progressions publication-title: J. of Symbolic Computation – volume: 13 start-page: 42 year: 1997 end-page: 49 ident: bib003 article-title: Rectangular matrix multiplication revisited publication-title: Journal of Symbolic Computation – volume: 380 start-page: 37 year: 2007 end-page: 46 ident: bib006 article-title: Faster algorithms for finding lowest common ancestors in directed acyclic graphs publication-title: The Special ICALP 2005 Issue – start-page: 417 year: 1993 end-page: 426 ident: bib008 article-title: Witnesses for Boolean matrix multiplication and shortest paths publication-title: Journal of Complexity – reference: P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, in: Proc. 13th Symposium on Discrete Algorithms (SODA), 2002, pp. 697–704 – volume: 16 start-page: 434 year: 1996 end-page: 449 ident: bib001 article-title: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions publication-title: Algorithmica – reference: S. Eckhardt, A. Mühling, J. Nowak, Fast lowest common ancestor computations in dags, in: Proc. of ESA 2007, 2007, pp. 705–716 – volume: vol. 4580 start-page: 28 year: 2007 end-page: 39 ident: bib002 article-title: Finding witnesses by peeling publication-title: Proc. CPM 2007 – ident: 10.1016/j.ipl.2008.10.012_bib007 doi: 10.1007/978-3-540-75520-3_25 – volume: vol. 4580 start-page: 28 year: 2007 ident: 10.1016/j.ipl.2008.10.012_bib002 article-title: Finding witnesses by peeling – volume: 9 start-page: 251 year: 1990 ident: 10.1016/j.ipl.2008.10.012_bib004 article-title: Matrix multiplication via arithmetic progressions publication-title: J. of Symbolic Computation doi: 10.1016/S0747-7171(08)80013-2 – volume: 14 start-page: 257 year: 1998 ident: 10.1016/j.ipl.2008.10.012_bib009 article-title: Fast rectangular matrix multiplications and applications publication-title: Journal of Complexity doi: 10.1006/jcom.1998.0476 – volume: 16 start-page: 434 year: 1996 ident: 10.1016/j.ipl.2008.10.012_bib001 article-title: Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions publication-title: Algorithmica doi: 10.1007/BF01940874 – start-page: 417 year: 1993 ident: 10.1016/j.ipl.2008.10.012_bib008 article-title: Witnesses for Boolean matrix multiplication and shortest paths publication-title: Journal of Complexity – volume: 13 start-page: 42 year: 1997 ident: 10.1016/j.ipl.2008.10.012_bib003 article-title: Rectangular matrix multiplication revisited publication-title: Journal of Symbolic Computation – ident: 10.1016/j.ipl.2008.10.012_bib005 doi: 10.1007/978-3-540-75520-3_62 – ident: 10.1016/j.ipl.2008.10.012_bib010 – volume: 380 start-page: 37 issue: 1–2 year: 2007 ident: 10.1016/j.ipl.2008.10.012_bib006 article-title: Faster algorithms for finding lowest common ancestors in directed acyclic graphs publication-title: Theoretical Computer Science doi: 10.1016/j.tcs.2007.02.053 |
| SSID | ssj0006437 |
| Score | 1.9180349 |
| SourceID | swepub pascalfrancis crossref elsevier |
| SourceType | Open Access Repository Index Database Enrichment Source Publisher |
| StartPage | 242 |
| SubjectTerms | Algorithmics. Computability. Computer arithmetics Algorithms Analysis of algorithms Applied sciences Boolean matrix multiplication Combinatorial problems Combinatorics Combinatorics. Ordered structures Computer and Information Sciences Computer science; control theory; systems Computer Sciences Data- och informationsvetenskap (Datateknik) Datavetenskap (Datalogi) Exact sciences and technology Graph theory Information retrieval. Graph Lowest common ancestors in dags Mathematics Miscellaneous Natural Sciences Naturvetenskap Sciences and techniques of general use Theoretical computing Time complexity, directed acyclic graph (dag) Witnesses for Boolean matrix product |
| Title | Faster multi-witnesses for Boolean matrix multiplication |
| URI | https://dx.doi.org/10.1016/j.ipl.2008.10.012 |
| Volume | 109 |
| WOSCitedRecordID | wos000262892600007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6119 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0006437 issn: 0020-0190 databaseCode: AIEXJ dateStart: 19950113 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1La9tAEF5cp4dC6LvUaRt0aC4FBb1XOoaQ9GVCD2kxvSyr1SyxqyoishOTX99ZzUqxHRraQi_CrKyHd8az38x-M8PY2xAhNfeldgvjm-B6m7jSNBEAT2oAHku_Deh_G_OTk3Qyyb4MBnWXC3NZ8qpKl8us_q-ixjEUtkmd_Qtx9zfFAfyMQscjih2PfyT4Y2lqHxBT0L2azo0tg7bqgklsKE3k_aepy7_syIQ2arcKU22SUqsbNaUSmJBC2eb-9Cj8fYtE4watwxTaTuljaK6hz_35fH4ly8UPYufjarx3GO-lwU3UfGzacTcdrfIaZmshiBsTdzsrxmYIGLIbtQHdBzKsKQ_QTbXmsbO89lbT1bgC2VEquWWX5ICKct6y9hR4mO3jVBEr1vD0LCt7vYi22ZM2aLYFyGHAJ_fYVsBRTYds6-Dj0eRTv3qbjUyiBdFv6HbCW07gxoN-h2W2a9ngP0xTa5SNIrQtcDl9zB5aj8M5IE15wgZQPWWPum4ejjXuz1hKiuNsKI6DmuBYxXFIcZx1xXnOvh4fnR5-cG1fDVdFPp-7qdK-jouE-0Xs80SGWQJRKCHJU5krLlVeRLGMAWGLinSexcoLU8gLdAYgUVCEL9iwOq_gJXMQXfphkXtKJTrKAp5nyvekRC8-DpRW3oh53QwJZYvOm94npejYhTOB70vNUHEIJ3XE3vWX1FRx5a4vR920CwsZCQoK1JG7LttdE1H_oAD97Sz1kxH7TjLrz5gy7OQRC1uG60yUC9GAqFfi6wISdLkQAwtdJKEwpAORah6IQEXS9K4A9Dh2_u2lX7EHtJVp4n-v2XB-sYA37L66nE-bi12rx78A96C7QQ |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Faster+multi-witnesses+for+Boolean+matrix+multiplication&rft.jtitle=Information+processing+letters&rft.au=G%C4%85sieniec%2C+Leszek&rft.au=Kowaluk%2C+Miros%C5%82aw&rft.au=Lingas%2C+Andrzej&rft.date=2009&rft.pub=Elsevier+B.V&rft.issn=0020-0190&rft.eissn=1872-6119&rft.volume=109&rft.issue=4&rft.spage=242&rft.epage=247&rft_id=info:doi/10.1016%2Fj.ipl.2008.10.012&rft.externalDocID=S002001900800327X |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0190&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0190&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0190&client=summon |