Ankit Vishnubhotla, Charlotte Loh, et al.
NeurIPS 2023
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.
Ankit Vishnubhotla, Charlotte Loh, et al.
NeurIPS 2023
Ismail Akhalwaya, Shashanka Ubaru, et al.
ICLR 2024
Salvatore Certo, Anh Pham, et al.
Quantum Machine Intelligence
Jehanzeb Mirza, Leonid Karlinsky, et al.
NeurIPS 2023