arXiv (All)
open access
Recognizable Picture Languages: Separating UREC from coUREC via Communication Complexity
We introduce communication-complexity lifting techniques into the study of recognizable picture languages. As an application, we resolve a long-standing open problem of Anselmo et al. (2006) by constructing a language in UREC whose complement does not belong to REC. Our lower-bound argument is inspi
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
- Stone Programming Paradigm: Language Abstraction#328816
- Dictionary-Constrained Grapheme-to-Phoneme for Unsegmented Languages from LLM-Annotated Data#1014389
- Metrics-First, language-aware clone type recognition: Auditable signals across C, C#, java, and python#289797
- Language Processing#3227
- Forward Error Correction Grouping Semantics in the Session Description Protocol#501305
Record · ID 1061952
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