Conceptio › Archive › arXiv (All)
arXiv (All)open access

Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances

Brakensiek, Joshua et al.
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
combinatoricsdiscrete-mathematicslogic-in-computer-science
discrete mathematics, logic in computer science, combinatorics
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 1036704
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.