Faster multi-witnesses for Boolean matrix multiplication

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 109; číslo 4; s. 242 - 247
Hlavní autoři: Gąsieniec, Leszek, Kowaluk, Mirosław, Lingas, Andrzej
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 2009
Elsevier
Témata:
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
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!
Popis
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2008.10.012