On testability of first-order properties in bounded-degree graphs

Adler, I., Köhler, N. and Peng, P. orcid.org/0000-0003-2700-5699 (2021) On testability of first-order properties in bounded-degree graphs. In: SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '21: ACM-SIAM Symposium on Discrete Algorithms, 10-13 Jan 2021, Virginia, Virtual Event. Association for Computing Machinery (ACM) , pp. 1578-1597. ISBN 9781611976465

Abstract

Metadata

Authors/Creators:
Copyright, Publisher and Additional Information: © 2020 Association for Computing Machinery. This is an author-produced version of a paper subsequently published in SODA '21: Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. Uploaded in accordance with the publisher's self-archiving policy.
Dates:
  • Accepted: 30 September 2020
  • Published (online): 21 March 2021
  • Published: 10 January 2021
Institution: The University of Sheffield
Academic Units: The University of Sheffield > Faculty of Engineering (Sheffield) > Department of Computer Science (Sheffield)
Depositing User: Symplectic Sheffield
Date Deposited: 12 Oct 2020 09:33
Last Modified: 19 Jan 2022 16:45
Published Version: https://dl.acm.org/doi/abs/10.5555/3458064.3458160
Status: Published
Publisher: Association for Computing Machinery (ACM)
Refereed: Yes
Identification Number: https://doi.org/10.5555/3458064.3458160
Related URLs:

Share / Export

Statistics