Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
computational complexity
Metadata
Title
On Blocky Ranks Of Matrices
Authors
Daniel Avraham
Amir Yehudayoff
Publication date
01-06-2024
Publisher
Springer International Publishing
Published in
computational complexity / Issue 1/2024
Print ISSN: 1016-3328
Electronic ISSN: 1420-8954
DOI
https://doi.org/10.1007/s00037-024-00248-1

Other articles of this Issue 1/2024

computational complexity 1/2024 Go to the issue

OriginalPaper

Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply

OriginalPaper

Limits of Preprocessing

OriginalPaper

KRW Composition Theorems via Lifting

OriginalPaper

Algebraic Global Gadgetry for Surjective Constraint Satisfaction

OriginalPaper

Approximating the chromatic polynomial is as hard as computing it exactly

OriginalPaper

Streaming approximation resistance of every ordering CSP

Premium Partner

    Image Credits