Simple proof of the impossibility of bit commitment in generalized probabilistic theories using cone programming

Research article (Physical review. A/Physical review, A, 2018) · cited 17× · AI/ML
Press Enter · cited answer in seconds

Simple proof of the impossibility of bit commitment in generalized probabilistic theories using cone programming

Summary

Simple proof of the impossibility of bit commitment in generalized probabilistic theories using cone programming is a scholarly article[1].

Key Facts

  • Simple proof of the impossibility of bit commitment in generalized probabilistic theories using cone programming's instance of is recorded as scholarly article[2].

📑 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). Simple proof of the impossibility of bit commitment in generalized probabilistic theories using cone programming. Retrieved May 24, 2026, from https://4ort.xyz/entity/simple-proof-of-the-impossibility-of-bit-commitment-in-generalized-probabilistic-theories-using-cone-programming
MLA “Simple proof of the impossibility of bit commitment in generalized probabilistic theories using cone programming.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/simple-proof-of-the-impossibility-of-bit-commitment-in-generalized-probabilistic-theories-using-cone-programming.
BibTeX @misc{4ortxyz_simple-proof-of-the-impossibility-of-bit-commitment-in-generalized-probabilistic-theories-using-cone-programming_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Simple proof of the impossibility of bit commitment in generalized probabilistic theories using cone programming}}, year = {2026}, url = {https://4ort.xyz/entity/simple-proof-of-the-impossibility-of-bit-commitment-in-generalized-probabilistic-theories-using-cone-programming}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Simple proof of the impossibility of bit commitment in generalized probabilistic theories using cone programming — https://4ort.xyz/entity/simple-proof-of-the-impossibility-of-bit-commitment-in-generalized-probabilistic-theories-using-cone-programming (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/simple-proof-of-the-impossibility-of-bit-commitment-in-generalized-probabilistic-theories-using-cone-programming · Last refreshed: