Sanyal, S. orcid.org/0000-0003-1546-7749 (2025) Randomized query composition and sabotage complexity. ACM Transactions on Computation Theory, 17 (4). pp. 1-19. ISSN: 1942-3454
Metadata
| Item Type: | Article |
|---|---|
| Authors/Creators: |
|
| Copyright, Publisher and Additional Information: | © 2025 Copyright held by the owner/author(s). The work is licensed under a Creative Commons Attribution 4.0 International Licence. https://creativecommons.org/licenses/by/4.0 |
| Keywords: | Applied Mathematics; Pure Mathematics; Mathematical Sciences |
| Dates: |
|
| Institution: | The University of Sheffield |
| Academic Units: | The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield) |
| Date Deposited: | 11 Feb 2026 11:56 |
| Last Modified: | 11 Feb 2026 11:57 |
| Status: | Published |
| Publisher: | Association for Computing Machinery (ACM) |
| Refereed: | Yes |
| Identification Number: | 10.1145/3747851 |
| Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:237809 |
Download
Filename: 3747851.pdf
Licence: CC-BY 4.0

CORE (COnnecting REpositories)
CORE (COnnecting REpositories)