Faster multi-witnesses for Boolean matrix multiplication

Saved in:
Bibliographic Details
Published in:Information processing letters Vol. 109; no. 4; pp. 242 - 247
Main Authors: Gąsieniec, Leszek, Kowaluk, Mirosław, Lingas, Andrzej
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 2009
Elsevier
Subjects:
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
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
ISSN:0020-0190, 1872-6119
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2008.10.012