Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Daniel P. Kennedy
Paul Kettle
Martina Weber
Dan Graur
Barbara Aquilani
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Schwartz, M.
Chen Ma
Home
/
Paper
/
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs.
Paper Info
Open Visualization
Title
Hardness of Approximation for Stochastic Problems via Interactive Oracle Proofs.
Year
Venue
DocType
2022
IACR Cryptology ePrint Archive
Journal
Volume
Citations
PageRank
2022
0
0.34
References
Authors
0
3
Authors (3 rows)
Cited by (0 rows)
References (0 rows)
Name
Order
Citations
PageRank
Gal Arnon
1
0
1.35
Alessandro Chiesa
2
899
46.20
Eylon Yogev
3
1
3.73
1
