arXiv (All)
open access
Computing Lower Bounds on the Non-negative Rank via SAT Solvers
Finding the extension complexity (xc) of a polytope is equivalent to finding the non-negative rank of its slack matrix. We provide a formulation for the rectangle and refined rectangle covering, bounding the non-negative rank of diverse non-negative matrices. While the bounds are known, our formulat
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Formally Certifying the Vertex Set of a Polyhedron Faster than Informal Enumeration#1249193
- The Factor Width Rank of a Matrix#1000456
- Rank-Aware Spectral Bounds on Attention Logits for Stable Low-Precision Training#1084141
- Polynomials with restricted support and maximal zeros on a finite Cartesian set#1202232
- RDT based upper bounds on the largest average submatrix values#1012503
Record · ID 1249230
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive