Correction to “Unambiguous Parity‐Query Complexity”

Random Structures and Algorithms 2026 Open access

Read full text
DOI: 10.1002/rsa.70051
Cited by: 0

Abstract

Gavinsky, D. 2025. “Unambiguous Parity-Query Complexity.” Random Structures & Algorithms 66: e70010. https://doi.org/10.1002/rsa.70010. Added “Partially funded by the grant 25-16311S of GA CR and by RVO: 67985840” as a front-page footnote. We apologize for this error.

Fields of Study & Subjects

Complexity and Algorithms in Graphs Quantum Computing Algorithms and Architecture Computability Logic AI Algorithms

Publication details

Journal / source
Random Structures and Algorithms
Volume
68
Issue
2
Publication date
3 February 2026
Language
EN