Fundamentals of Computation Theory
From MaRDI portal
Publication:5492932
DOI10.1007/11537311zbMath1123.68049OpenAlexW2491671784MaRDI QIDQ5492932
Miklos Santha, Gábor Ivanyos, Yves F. Verhoeven, Katalin Friedl
Publication date: 20 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11537311
Analysis of algorithms and problem complexity (68Q25) Quantum computation (81P68) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
On the quantum query complexity of local search in two and three dimensions ⋮ On the black-box complexity of Sperner's Lemma ⋮ Quantum separation of local search and fixed point computation ⋮ Quantum and classical query complexities of local search are polynomially related ⋮ A simplicial approach for discrete fixed point theorems ⋮ On the complexity of 2D discrete fixed point problem
This page was built for publication: Fundamentals of Computation Theory
