Faster multi-witnesses for Boolean matrix multiplication

Leszek Gasieniec; Miroslaw Kowaluk; Andrzej Lingas

doi:10.1016/j.ipl.2008.10.012

Faster multi-witnesses for Boolean matrix multiplication

Leszek Gasieniec, Miroslaw Kowaluk, Andrzej Lingas

Forskningsoutput: Tidskriftsbidrag › Artikel i vetenskaplig tidskrift › Peer review

Originalspråk	engelska
Sidor (från-till)	242-247
Tidskrift	Information Processing Letters
Volym	109
Nummer	4
DOI	https://doi.org/10.1016/j.ipl.2008.10.012
Status	Published - 2009

Ämnesklassifikation (UKÄ)

Datavetenskap (Datalogi)

Tillgång till dokument

10.1016/j.ipl.2008.10.012

Citera det här

@article{e6099185fd6346058f722c4a0084e505,

title = "Faster multi-witnesses for Boolean matrix multiplication",

keywords = "Time complexity, directed acyclic graph (dag), Lowest common ancestors, in dags, Algorithms, Combinatorial problems, Analysis of algorithms, Boolean matrix multiplication, Witnesses for Boolean matrix product",

author = "Leszek Gasieniec and Miroslaw Kowaluk and Andrzej Lingas",

year = "2009",

doi = "10.1016/j.ipl.2008.10.012",

language = "English",

volume = "109",

pages = "242--247",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

number = "4",

}

TY - JOUR

T1 - Faster multi-witnesses for Boolean matrix multiplication

AU - Gasieniec, Leszek

AU - Kowaluk, Miroslaw

AU - Lingas, Andrzej

PY - 2009

Y1 - 2009

KW - Time complexity

KW - directed acyclic graph (dag)

KW - Lowest common ancestors

KW - in dags

KW - Algorithms

KW - Combinatorial problems

KW - Analysis of algorithms

KW - Boolean matrix multiplication

KW - Witnesses for Boolean matrix product

U2 - 10.1016/j.ipl.2008.10.012

DO - 10.1016/j.ipl.2008.10.012

M3 - Article

SN - 0020-0190

VL - 109

SP - 242

EP - 247

JO - Information Processing Letters

JF - Information Processing Letters

IS - 4

ER -