On the complexity of Boolean matrix ranks
Combinatorics
2013-06-06 v1 Computational Complexity
Authors:
Yaroslav Shitov
Abstract
We construct a reduction which proves that the fooling set number and the determinantal rank of a Boolean matrix are NP-hard to compute.
Keywords
Cite
@article{arxiv.1306.1114,
title = {On the complexity of Boolean matrix ranks},
author = {Yaroslav Shitov},
journal= {arXiv preprint arXiv:1306.1114},
year = {2013}
}
Related papers
View all related →
Computational Complexity · Computer Science
Lower bound for the Complexity of the Boolean Satisfiability Problem
Carlos Barrón-Romero
2016-04-15
Computational Complexity · Computer Science
The complexity of computing the minimum rank of a sign pattern matrix
Amey Bhangale, Swastik Kopparty
2015-05-18
Computational Complexity · Computer Science
On relative OR-complexity of Boolean matrices and their complements
Igor S. Sergeev
2014-07-18
Computational Complexity · Computer Science
Automating Resolution is NP-Hard
Albert Atserias, Moritz Müller
2019-09-10
Computational Complexity · Computer Science
A Lower Bound on Determinantal Complexity
Mrinal Kumar, Ben Lee Volk
2021-12-03
Computational Complexity · Computer Science
Barriers for Rank Methods in Arithmetic Complexity
Klim Efremenko, Ankit Garg, Rafael Oliveira, Avi Wigderson
2017-10-27
Computational Complexity · Computer Science
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
Nadia Creignou, Johannes Schmidt, Michael Thomas
2010-06-29
Discrete Mathematics · Computer Science
Mathematical and computational perspectives on the Boolean and binary rank and their relation to the real rank
Michal Parnas
2026-01-22
Optimization and Control · Mathematics
Computational complexity of decomposing a symmetric matrix as a sum of positive semidefinite and diagonal matrices
Levent Tunçel, Stephen A. Vavasis, Jingye Xu
2023-10-02
Number Theory · Mathematics
Statistics of ranks, determinants and characteristic polynomials of rational matrices
Muhammad Afifurrahman, Vivian Kuperberg, Alina Ostafe, Igor E. Shparlinski
2026-03-04
Symbolic Computation · Computer Science
Beating binary powering for polynomial matrices
Alin Bostan, Vincent Neiger, Sergey Yurkevich
2023-05-29
Combinatorics · Mathematics
The nonnegative rank of a matrix: Hard problems, easy solutions
Yaroslav Shitov
2018-01-01
Artificial Intelligence · Computer Science
On the Complexity and Approximation of Binary Evidence in Lifted Inference
Guy Van den Broeck, Adnan Darwiche
2013-11-27
Symbolic Computation · Computer Science
Nearly Optimal Computations with Structured Matrices
Victor Y. Pan, Elias Tsigaridas
2014-04-21
Computational Complexity · Computer Science
The Log-Rank Conjecture: New Equivalent Formulations
Lianna Hambardzumyan, Shachar Lovett, Morgan Shirley
2026-03-02
Computational Complexity · Computer Science
Log-rank and lifting for AND-functions
Alexander Knop, Shachar Lovett, Sam McGuire, Weiqiang Yuan
2020-10-23
Machine Learning · Computer Science
Low-Rank Boolean Matrix Approximation by Integer Programming
Reka Kovacs, Oktay Gunluk, Raphael Hauser
2018-03-14
Computational Complexity · Computer Science
Complexity classifications for different equivalence and audit problems for Boolean circuits
Elmar Böhler, Nadia Creignou, Matthias Galota, Steffen Reith +2
2015-07-01
Computational Complexity · Computer Science
On the Approximation Method and the P versus NP Problem
Norbert Blum
2020-06-16
Computational Complexity · Computer Science
Hardness as randomness: a survey of universal derandomization
Russell Impagliazzo
2008-12-15
Combinatorics · Mathematics
How hard is the tensor rank?
Yaroslav Shitov
2016-11-08
Quantum Physics · Physics
Computing Boolean Functions: Exact Quantum Query Algorithms and Low Degree Polynomials
Alina Dubrovska Vasilieva, Taisija Mischenko-Slatenkova
2012-03-24
Optimization and Control · Mathematics
Hardness of some optimization problems over correlation polyhedra
Alberto Caprara, Fabio Furini, Claudio Gentile, Leo Liberti +1
2026-05-06
Computational Complexity · Computer Science
Bipartite 3-Regular Counting Problems with Mixed Signs
Jin-Yi Cai, Austen Z. Fan, Yin Liu
2021-10-05
Logic in Computer Science · Computer Science
On matrix rank function over bounded arithmetics
Eitetsu Ken, Satoru Kuroda
2025-08-20