\(P^5\): planner-less proofs of probabilistic parameterized protocols (Q3296338)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7218147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \(P^5\): planner-less proofs of probabilistic parameterized protocols |
scientific article; zbMATH DE number 7218147 |
Statements
$$P^5$$ : Planner-less Proofs of Probabilistic Parameterized Protocols (English)
0 references
7 July 2020
0 references
0.7645387053489685
0 references
0.7426044344902039
0 references
0.7402451634407043
0 references
0.7252485156059265
0 references
