Browsing by Author "Karpinski M."

Sort by: Order: Results:

  • On BPP versus NP ∪ coNP for ordered read-once branching programs 
    Ablayev F.; Karpinski M.; Mubarakzjanov R. (2001)
    We investigate the relationship between probabilistic and nondeterministic complexity classes PP, BPP, NP and coNP with respect to ordered read-once branching programs (OBDDs). We exhibit two explicit Boolean functions ...
  • On the computational power of probabilistic and quantum branching program 
    Ablayev F.; Gainutdinova A.; Karpinski M.; Moore C.; Pollett C. (2005)
    In this paper, we show that one-qubit polynomial time computations are as powerful as NC1 circuits. More generally, we define syntactic models for quantum and stochastic branching programs of bounded width and prove upper ...

Search DSpace

Browse

My Account