On BPP versus \(NP\cup coNP\) for ordered read-once branching programs

DOI10.1016/S0304-3975(00)00216-4zbMath0972.68091DBLPjournals/tcs/AblayevKM01WikidataQ62045249 ScholiaQ62045249MaRDI QIDQ5941564

Marek Karpinski, R. Mubarakzjanov, Farid M. Ablayev

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

ordered read-once branching programs

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

Unnamed Item

Cites Work

• Efficient data structures for Boolean functions
• A lower bound for integer multiplication on randomized ordered read-once branching programs.
• On P versus NP\(\cap\)co-NP for decision trees and read-once branching programs
• On lower bounds for read-\(k\)-times branching programs
• Cyclic Spaces for Grassmann Derivatives and Additive Theory
• Randomization and nondeterminism are comparable for ordered read-once branching programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On BPP versus \(NP\cup coNP\) for ordered read-once branching programs