scientific article; zbMATH DE number 1283990

MaRDI QIDQ4240332zbMATH OpenFDO

Authors R. Mubarakzjanov, F. Ablayev, Marek Karpinski

Publication date 3 May 1999

Full work available at URL http://www.eccc.uni-trier.de/eccc/info/call.html

zbMATH Keywords

nondeterministic complexity classes

Mathematics Subject Classification ID

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

Recommendations

• On BPP versus \(NP\cup coNP\) for ordered read-once branching programs
• Randomization and nondeterminism are comparable for ordered read-once branching programs
• On the size of randomized OBDDs and read-once branching programs for k-stable functions

Cited in

(2)

• scientific article; zbMATH DE number 1361490 (Why is no real title available?)
• On BPP versus \(NP\cup coNP\) for ordered read-once branching programs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4240332)