pith. sign in

arxiv: 1006.3651 · v1 · submitted 2010-06-18 · 🪐 quant-ph · cs.CC· cs.DS

Quantum algorithms for formula evaluation

classification 🪐 quant-ph cs.CCcs.DS
keywords algorithmsbooleanconsistingevaluatingevaluationformulaformulasgates
0
0 comments X
read the original abstract

We survey the recent sequence of algorithms for evaluating Boolean formulas consisting of NAND gates.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.