On the complexity of trial and error

DOI10.1145/2488608.2488613zbMath1293.68157arXiv1205.1183OpenAlexW2074058199MaRDI QIDQ5495773

Shengyu Zhang, Xiaohui Bei, Ning Chen

Publication date: 7 August 2014

Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1205.1183

zbMATH Keywords

complexityconstraint satisfaction problemquerytrial and errorunknown input

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (3)

Solving Linear Programming with Constraints Unknown ⋮ On the complexity of trial and error for constraint satisfaction problems ⋮ A stable marriage requires communication

This page was built for publication: On the complexity of trial and error