Advanced

Faster multi-witnesses for Boolean matrix multiplication

Gasieniec, Leszek; Kowaluk, Miroslaw and Lingas, Andrzej LU (2009) In Information Processing Letters 109(4). p.242-247
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
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
in
Information Processing Letters
volume
109
issue
4
pages
242 - 247
publisher
Elsevier
external identifiers
  • wos:000262892600007
  • scopus:59149098020
ISSN
0020-0190
DOI
10.1016/j.ipl.2008.10.012
project
VR 2008-4649
language
English
LU publication?
yes
id
e6099185-fd63-4605-8f72-2c4a0084e505 (old id 1311474)
date added to LUP
2009-03-17 09:56:51
date last changed
2017-03-19 03:45:52
@article{e6099185-fd63-4605-8f72-2c4a0084e505,
  author       = {Gasieniec, Leszek and Kowaluk, Miroslaw and Lingas, Andrzej},
  issn         = {0020-0190},
  keyword      = {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},
  language     = {eng},
  number       = {4},
  pages        = {242--247},
  publisher    = {Elsevier},
  series       = {Information Processing Letters},
  title        = {Faster multi-witnesses for Boolean matrix multiplication},
  url          = {http://dx.doi.org/10.1016/j.ipl.2008.10.012},
  volume       = {109},
  year         = {2009},
}