arXiv (All)
open access
Near-Optimal Bounds for Testing Residual-String Equality and Parenthesis Languages
Residual-String Equality, denoted $\texttt{ResStringEq}$, is the property consisting of all pairs of strings over $\{0,1,*\}$ that are equal after deleting all `$*$' symbols from them. This property was first introduced by Fischer, Magniez, and Starikovskaya (SODA 2018), who used it to show a lower
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
- A New Approach to Code Smoothing Bounds#927259
- NIST SP 800-168: Approximate Matching: Definition and Terminology#2917
- Bounds for Distributionally Robust Optimization Problems#609778
- Vulnerability Abundance: A formal proof of infinite vulnerabilities in code#2464
- Finding and Understanding Miscompilation Bugs in the Solidity Compiler#349694
Record · ID 1130393
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