Author： Goćwin Maciej
Publisher： Springer Publishing Company
ISSN： 1570-0755
Source： Quantum Information Processing, Vol.5, Iss.1, 2006-02, pp. : 31-41
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Quantum communication and complexity
By de Wolf R.
Theoretical Computer Science, Vol. 287, Iss. 1, 2002-09 ,pp. :
Access to resources
Recommend
On Logarithmic Smoothing of the Maximum Function
Annals of Operations Research, Vol. 101, Iss. 1-4, 2001-01 ,pp. :
On the Complexity of Function Learning
By Auer P.
Machine Learning, Vol. 18, Iss. 2-3, 1995-02 ,pp. :
Comparison between the complexity of a function and the complexity of its graph
Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. :
Simulation on a quantum computer
Informatik - Forschung und Entwicklung, Vol. 21, Iss. 1-2, 2006-10 ,pp. :