Algorithms and Computation

DOI10.1007/b94771zbMath1205.68157arXivquant-ph/0212048OpenAlexW1769833081MaRDI QIDQ5191645

V. Arvind, Rainer Schuler

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

Mathematics Subject Classification ID

Boolean programming (90C09) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

A Moderately Exponential Time Algorithm for k-IBDD Satisfiability ⋮ 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 ⋮ Satisfiability Algorithm for Syntactic Read-$k$-times Branching Programs

This page was built for publication: Algorithms and Computation