Conceptio › Archive › OpenAlex

OpenAlexmetadata only

Completeness theorems for non-cryptographic fault-tolerant distributed computation

Michael Ben-Or et al.

OpenAlex · Papers · License: Open Access

Open Source ↗

Computer science, Cryptography, Completeness (order theory), Cryptographic primitive, Computation, Fault tolerance

This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗

Related documents

Appropriateness of Cardiovascular Disease Prevention Recommendations Obtained From a Popular Online Chat-Based Artificial Intelligence Model#663227
Could an artificial-intelligence agent pass an introductory physics course?#663228
DSMAC: Privacy-Aware Decentralized Self-Management of Data Access Control Based on Blockchain for Health Data#663231
Artificial intelligence and privacy#663232
Bias Preservation in Machine Learning: The Legality of Fairness Metrics Under EU Non-Discrimination Law#663233

Record · ID 6691
Conceptio Open Knowledge Archive — every document is proof-bundled with source, license, and retrieval metadata.