Pages that link to "Item:Q1144943"
From MaRDI portal
The following pages link to Equivalence of free Boolean graphs can be decided probabilistically in polynomial time (Q1144943):
Displaying 16 items.
- Graph driven BDDs -- a new data structure for Boolean functions (Q673788) (← links)
- Probabilistic verification of Boolean functions (Q685120) (← links)
- On approximation by \(^{\oplus}\)-OBDDs (Q845954) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- Deterministic and probabilistic algorithms for maximum bipartite matching via fast matrix multiplication (Q1157169) (← links)
- On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs (Q1330665) (← links)
- A linear time equivalence test for read-twice DNF formulas (Q1334630) (← links)
- Efficient data structures for Boolean functions (Q1344625) (← links)
- Learning from examples with unspecified attribute values. (Q1401919) (← links)
- A deterministic algorithm for testing the equivalence of read-once branching programs with small discrepancy (Q2011643) (← links)
- Local decoding and testing of polynomials over grids (Q4993289) (← links)
- (Q5092488) (← links)
- On the complexity of constructing optimal ordered binary decision diagrams (Q5096910) (← links)
- Monotone term decision lists (Q5941293) (← links)
- Decision tree approximations of Boolean functions (Q5958322) (← links)
- (Q6084351) (← links)
