Home › Entities › academic_journal_article › Non-deterministic exponential time has two-prover interactive protocols

Non-deterministic exponential time has two-prover interactive protocols

1991 journal article
Place academic_journal_article Q56700057
Press Enter · cited answer in seconds

Non-deterministic exponential time has two-prover interactive protocols

Summary

Non-deterministic exponential time has two-prover interactive protocols is an academic journal article[1].

Key Facts

  • Non-deterministic exponential time has two-prover interactive protocols authored László Babai[2].
  • Non-deterministic exponential time has two-prover interactive protocols's instance of is recorded as academic journal article[3].
  • Non-deterministic exponential time has two-prover interactive protocols's page is recorded as 3-40[4].
  • Non-deterministic exponential time has two-prover interactive protocols's DOI is recorded as 10.1007/BF01200056[5].
  • Non-deterministic exponential time has two-prover interactive protocols's issue is recorded as 1[6].
  • Non-deterministic exponential time has two-prover interactive protocols's volume is recorded as 1[7].
  • Non-deterministic exponential time has two-prover interactive protocols's publication date is recorded as +1991-03-00T00:00:00Z[8].
  • Non-deterministic exponential time has two-prover interactive protocols's zbMATH Open document ID is recorded as 0774.68041[9].
  • Non-deterministic exponential time has two-prover interactive protocols's number of pages is recorded as {'unit': '1', 'amount': '+38'}[10].
  • Non-deterministic exponential time has two-prover interactive protocols's published in is recorded as Computational Complexity[11].
  • Non-deterministic exponential time has two-prover interactive protocols's title is recorded as Non-deterministic exponential time has two-prover interactive protocols[12].
  • Non-deterministic exponential time has two-prover interactive protocols's author name string is recorded as Lance Fortnow[13].
  • Non-deterministic exponential time has two-prover interactive protocols's author name string is recorded as Carsten Lund[14].
  • Non-deterministic exponential time has two-prover interactive protocols's cites work is recorded as Separating Nondeterministic Time Complexity Classes[15].
  • Non-deterministic exponential time has two-prover interactive protocols's cites work is recorded as Fast Probabilistic Algorithms for Verification of Polynomial Identities[16].
  • Non-deterministic exponential time has two-prover interactive protocols's CiteSeerX article ID is recorded as 10.1.1.130.9311[17].
  • Non-deterministic exponential time has two-prover interactive protocols's Semantic Scholar paper ID is recorded as b2521c1153f7b7649b0d1115b78bdaa42086f65d[18].
  • Non-deterministic exponential time has two-prover interactive protocols's Google Scholar paper ID is recorded as 1286357867953652219[19].
  • Non-deterministic exponential time has two-prover interactive protocols's Altmetric DOI is recorded as 10.1007/BF01200056[20].
  • Non-deterministic exponential time has two-prover interactive protocols's ResearchGate publication ID is recorded as 221499638[21].
  • Non-deterministic exponential time has two-prover interactive protocols's maintained by WikiProject is recorded as WikiProject Mathematics[22].
  • Non-deterministic exponential time has two-prover interactive protocols's Dimensions publication ID is recorded as 1036331166[23].
  • Non-deterministic exponential time has two-prover interactive protocols's Mendeley publication ID is recorded as 00498780-57f9-3cc0-9020-0cf31f673a31[24].
  • Non-deterministic exponential time has two-prover interactive protocols's Semantic Scholar corpus ID is recorded as 953323[25].
  • Non-deterministic exponential time has two-prover interactive protocols's DBLP publication ID is recorded as journals/cc/BabaiFL91[26].

Body

Designation and Status

Non-deterministic exponential time has two-prover interactive protocols's instance of is recorded as academic journal article[3].

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [3] ↑ . wikidata.org.
  2. [2] ↑ . wikidata.org.
  3. [4] ↑ . wikidata.org.
  4. [5] ↑ . wikidata.org.
  5. [6] ↑ . wikidata.org.
  6. [7] ↑ . wikidata.org.
  7. [8] ↑ . wikidata.org.
  8. [9] ↑ . wikidata.org.
  9. [10] ↑ . wikidata.org.
  10. [11] ↑ . wikidata.org.
  11. [12] ↑ . wikidata.org.
  12. [13] ↑ . wikidata.org.
  13. [14] ↑ . wikidata.org.
  14. [15] ↑ . Q5188229. Retrieved . api.crossref.org. Provenance: wikidata.org.
  15. [16] ↑ . Q5188229. Retrieved . api.crossref.org. Provenance: wikidata.org.
  16. [17] ↑ . wikidata.org.
  17. [18] ↑ . wikidata.org.
  18. [19] ↑ . wikidata.org.
  19. [20] ↑ . wikidata.org.
  20. [21] ↑ . wikidata.org.
  21. [22] ↑ . wikidata.org.
  22. [23] ↑ . wikidata.org.
  23. [24] ↑ . wikidata.org.
  24. [25] ↑ . wikidata.org.
  25. [26] ↑ . DBLP Dataset 2021-01-02. Retrieved . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 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). Non-deterministic exponential time has two-prover interactive protocols. Retrieved May 3, 2026, from https://4ort.xyz/entity/non-deterministic-exponential-time-has-two-prover-interactive-protocols
MLA “Non-deterministic exponential time has two-prover interactive protocols.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/non-deterministic-exponential-time-has-two-prover-interactive-protocols.
BibTeX @misc{4ortxyz_non-deterministic-exponential-time-has-two-prover-interactive-protocols_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Non-deterministic exponential time has two-prover interactive protocols}}, year = {2026}, url = {https://4ort.xyz/entity/non-deterministic-exponential-time-has-two-prover-interactive-protocols}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Non-deterministic exponential time has two-prover interactive protocols — https://4ort.xyz/entity/non-deterministic-exponential-time-has-two-prover-interactive-protocols (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/non-deterministic-exponential-time-has-two-prover-interactive-protocols · Last refreshed: