Algorithms and Computation
From MaRDI portal
Publication:5191645
DOI10.1007/b94771zbMath1205.68157arXivquant-ph/0212048MaRDI QIDQ5191645
Publication date: 7 August 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0212048
Related Items
Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs, A satisfiability algorithm and average-case hardness for formulas over the full binary basis, A moderately exponential time algorithm for \(k\)-IBDD satisfiability, Quantum binary search algorithm, A Moderately Exponential Time Algorithm for k-IBDD Satisfiability