Property testing of the Boolean and binary rank

08/30/2019
by   Michal Parnas, et al.
0

We present algorithms for testing if a (0,1)-matrix M has Boolean/binary rank at most d, or is ϵ-far from Boolean/binary rank d (i.e., at least an ϵ-fraction of the entries in M must be modified so that it has rank at most d). The query complexity of our testing algorithm for the Boolean rank is Õ(d^4/ ϵ^6). For the binary rank we present a testing algorithm whose query complexity is O(2^2d/ϵ). Both algorithms are 1-sided error algorithms that always accept M if it has Boolean/binary rank at most d, and reject with probability at least 2/3 if M is ϵ-far from Boolean/binary rank d.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/19/2017

Boolean Unateness Testing with O(n^3/4) Adaptive Queries

We give an adaptive algorithm which tests whether an unknown Boolean fun...
research
01/11/2023

A Note on Property Testing of the Binary Rank

Let M be a n× m (0,1)-matrix. We define the s-binary rank, br_s(M), of M...
research
12/18/2020

Factorizations of Binary Matrices – Rank Relations and the Uniqueness of Boolean Decompositions

The application of binary matrices are numerous. Representing a matrix a...
research
07/11/2016

Enhanced Boolean Correlation Matrix Memory

This paper introduces an Enhanced Boolean version of the Correlation Mat...
research
11/26/2013

On the Complexity and Approximation of Binary Evidence in Lifted Inference

Lifted inference algorithms exploit symmetries in probabilistic models t...
research
03/20/2020

Probabilistic learning of boolean functions applied to the binary classification problem with categorical covariates

In this work we cast the problem of binary classification in terms of es...
research
06/25/2021

Binary Matrix Factorisation and Completion via Integer Programming

Binary matrix factorisation is an essential tool for identifying discret...

Please sign up or login with your details

Forgot password? Click here to reset