Results 61 to 70 of about 4,000 (161)
Matroidal structure of generalized rough sets based on symmetric and transitive relations [PDF]
, 2012 Rough sets are efficient for data pre-process in data mining. Lower and upper approximations are two core concepts of rough sets. This paper studies generalized rough sets based on symmetric and transitive relations from the operator-oriented view by ...
Yang, Bin, Zhu, William
core
Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms
, 2014 Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms based on iterative message passing.
Helmling, Michael +2 more
core +1 more source
Circuit Decompositions of Binary Matroids
SIAM Journal on Discrete MathematicsGiven a simple Eulerian binary matroid $M$, what is the minimum number of disjoint circuits necessary to decompose $M$? We prove that $|M| / (\operatorname{rank}(M) + 1)$ many circuits suffice if $M = \mathbb F_2^n \setminus \{0\}$ is the complete binary matroid, for certain values of $n$, and that $\mathcal{O}(2^{\operatorname{rank}(M ...
Bryce Frederickson, Lukas Michel
openaire +2 more sources
On Local Equivalence, Surface Code States and Matroids
, 2010 Recently, Ji et al disproved the LU-LC conjecture and showed that the local unitary and local Clifford equivalence classes of the stabilizer states are not always the same.
I. Niven +5 more
core +1 more source
Minimally 3-connected binary matroids
European Journal of Combinatorics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Anderson, Joe, Wu, Haidong
openaire +2 more sources
Binary Matroids and Quantum Probability Distributions [PDF]
, 2010 We characterise the probability distributions that arise from quantum circuits all of whose gates commute, and show when these distributions can be classically simulated efficiently.
Shepherd, Dan
core
On Binary Matroid Minors and Applications to Data Storage over Small Fields
, 2017 Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature.
A Dimakis +13 more
core +1 more source
Discrete Mathematics, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Even Delta-Matroids and the Complexity of Planar Boolean CSPs
, 2017 The main result of this paper is a generalization of the classical blossom algorithm for finding perfect matchings. Our algorithm can efficiently solve Boolean CSPs where each variable appears in exactly two constraints (we call it edge CSP) and all ...
Kazda, Alexandr +2 more
core +1 more source
Cycle covering of binary matroids
Journal of Combinatorial Theory, Series B, 1989 AbstractMotivated by some problems which had been left open in a previous paper [M. Tarsi, J. Combin. Theory Ser. B 39 (1985), 346–352], we present the following results: 1.1. Every bridgeless binary matroid with no F7∗ minor (in particular every regular matroid) had a cycle in which every element is covered exactly 4 times.2.2.
Jamshy, Ury, Tarsi, Michael
openaire +1 more source