On approximation by \(^{\oplus}\)-OBDDs
type: Item
instance of: scholarly article
title: On approximation by \(^{\oplus}\)-OBDDs
zbMATH Open document ID: 1184.68262
author: Henrik Brosenne
author: Carsten Damm
author: Matthias Homeister
author: Stephan Waack
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 5664772
zbMATH Keywords: computational complexity
zbMATH Keywords: nondeterministic OBDD
zbMATH Keywords: parity OBDD
zbMATH Keywords: approximation
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.10.011
OpenAlex ID: W2081050659
cites work: On arithmetic branching programs
cites work: Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
cites work: On relations between counting communication complexity classes
cites work: A note on matrix rigidity
cites work: On oblivious branching programs of linear length
cites work: Fast Probabilistic Algorithms for Verification of Polynomial Identities
cites work: Branching Programs and Binary Decision Diagrams
cites work: Q3851616
DOI: 10.1016/J.IPL.2006.10.011
description: scientific article; zbMATH DE number 5664772