Topological aspects of matrix abduction. II
From MaRDI portal
Publication:5350344
Recommendations
- Topological aspects of matrix abduction. I
- A minimal completion of \((0,1)\)-matrices without total support
- An efficient algorithm of deriving a Hasse diagram from the reachability matrix of a partial order relation and its application to cognitive diagnosis
- scientific article; zbMATH DE number 2185737
- scientific article; zbMATH DE number 736305
Cites work
- scientific article; zbMATH DE number 2089399 (Why is no real title available?)
- scientific article; zbMATH DE number 4158856 (Why is no real title available?)
- scientific article; zbMATH DE number 53952 (Why is no real title available?)
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Analysis of the Talmudic argumentum a fortiori inference rule (Kal Vachomer) using matrix abduction
- Computational aspects of the 2-dimension of partially ordered sets
- Exact matrix completion via convex optimization
- Note on Dilworth's Decomposition Theorem for Partially Ordered Sets
- Reducibility among combinatorial problems
- The Hardness of Approximating Poset Dimension
- The complexity of embedding orders into small products of chains
- The road to universal logic. Festschrift for the 50th birthday of Jean-Yves Béziau. Volume II
Cited in
(3)
This page was built for publication: Topological aspects of matrix abduction. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5350344)