317 citations · 321 across the 11 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.LO2022
A programming language characterizing quantum polynomial time
Emmanuel Hainry, Romain Péchoux, Mário Silva
We introduce a first-order quantum programming language, named FOQ, whose terminating programs are reversible. We restrict FOQ to a strict and tractable subset, named PFOQ, of term…
cs.LO2022
Complete and tractable machine-independent characterizations of second-order polytime
Emmanuel Hainry, Bruce M. Kapron, Jean-Yves Marion +1
The class of Basic Feasible Functionals BFF is the second-order counterpart of the class of first-order functions computable in polynomial time. We present several implicit charact…