Deutsche Nationalbibliothek
metadata only
Computational Complexity of the Weisfeiler-Leman Dimension / Moritz Lichter, Simon Raßmann, Pascal Schweitzer
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
- The Complexity Kink: A Prompt-Side Structural Complexity Index for Code-Generation Reliability#1014206
- The Complexity Kink: A Prompt-Side Structural Complexity Index for Code-Generation Reliability#978496
- SciCode-Verified: How Benchmark Defects Underestimated the Scientific-Coding Ability of Language Models#429402
- Complexity and scientific idealization: A philosophical introduction to the study of complex systems#94185
- When Is a Relevance Threshold Statistically Resolvable? Minimax Limits for Effect Classification#1110388
Record · ID 628988
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