arXiv (All)open access
An exponential lower bound for the bit pigeonhole principle in resolution over parities
computational complexity, logic in computer science, 03f20 (primary), 68q17 (secondary), f.2.2; f.4.1
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 1048410
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.