arXiv (All)
open access
Complexity of decision problems for hyperedge replacement grammars
This paper investigates complexity of various decision problems for hyperedge replacement grammars, starting with the uniform membership problem. It turns out that the complexity of the latter problem depends on how one defines a hypergraph. There are two commonly used definitions in the field, whic
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
- Perfect Matching in $k$-Partite $k$-Uniform Hypergraphs#1141333
- Property B for random non-uniform hypergraphs#1216754
- The Oxford handbook of computational linguistics#341467
- Testing the Independent Set Property in Hypergraphs / Elena Grigorescu, Shreya Nasa, Cameron Seth#1188552
- Enumeration of regular multipartite hypergraphs#1049618
Record · ID 1199651
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