Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So Simple
Research article (ACM Transactions on Computational Logic, 2017) · cited 13× · AI/ML
Press Enter · cited answer in seconds
References
Programmatic citations — every numbered marker resolves to a verifiable graph row below.
Direct Wikidata claims
- [2] ↑ Are Short Proofs Narrow? QBF Resolution Is Not So Simple — instance of (P31): scholarly article. wikidata.org.
Class ancestry
📑 Cite this page
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA
4ort.xyz Knowledge Graph. (2026). Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So Simple. Retrieved May 24, 2026, from https://4ort.xyz/entity/are-short-proofs-narrow-qbf-resolution-is-i-not-i-so-simple
MLA
“Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So Simple.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/are-short-proofs-narrow-qbf-resolution-is-i-not-i-so-simple.
BibTeX
@misc{4ortxyz_are-short-proofs-narrow-qbf-resolution-is-i-not-i-so-simple_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So Simple}}, year = {2026}, url = {https://4ort.xyz/entity/are-short-proofs-narrow-qbf-resolution-is-i-not-i-so-simple}, note = {Accessed: 2026-05-24}}
LLM prompt
According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Are Short Proofs Narrow? QBF Resolution Is <i>Not</i> So Simple — https://4ort.xyz/entity/are-short-proofs-narrow-qbf-resolution-is-i-not-i-so-simple (retrieved 2026-05-24)
Canonical URL: https://4ort.xyz/entity/are-short-proofs-narrow-qbf-resolution-is-i-not-i-so-simple · Last refreshed: