arXiv (All)open access
Rational Reductions and Regular Languages of Constant Circuit Complexity
computational complexity, formal languages and automata theory, logic in computer science, f.4.3; f.1.3
This document is indexed with metadata only — full text is not available in the archive for this record.
Open the official source ↗
Record · ID 1012666
Retrieved via
Conceptio — every document is proof-bundled with source, license, and retrieval metadata.