Conference paper
Topological Data Analysis on Noisy Quantum Computers
Ismail Akhalwaya, Shashanka Ubaru, et al.
ICLR 2024
The problem of finding the circular attributes in an attribute grammar is considered. Two algorithms are proposed: the first is polynomial but yields conservative results while the second is exact but is potentially exponential. It is also shown that finding the circular attributes is harder than testing circularity. © 1999 ACM.
Ismail Akhalwaya, Shashanka Ubaru, et al.
ICLR 2024
Albert Atserias, Anuj Dawar, et al.
Journal of the ACM
Zahra Ashktorab, Djallel Bouneffouf, et al.
IJCAI 2025
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence