On Learning Bounded-Width Branching Programs

doi 10.1145/225298.225342
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Parametric Problems on Graphs of Bounded Tree-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1992English

Parity Games of Bounded Tree- And Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2015English

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1998English

Nonlinear Programs With Positively Bounded Jacobians

1964English

Collective Tree Spanners in Graphs With Bounded Genus, Chordality, Tree-Width, or Clique-Width

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Bounded Expectations: Resource Analysis for Probabilistic Programs

2018English

On the Completeness of Verifying Message Passing Programs Under Bounded Asynchrony

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Graphs With Bounded Tree-Width and Large Odd-Girth Are Almost Bipartite

Journal of Combinatorial Theory. Series B
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2010English

On the Nonapproximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy