Theory and Applications of Models of Computation

DOI10.1007/11750321zbMath1178.68292OpenAlexW4296156427MaRDI QIDQ5898888

Xiaoming Sun

Publication date: 30 April 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11750321

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Tight bounds on sensitivity and block sensitivity of some classes of transitive functions

This page was built for publication: Theory and Applications of Models of Computation