Minimization problems for parity OBDDs (Q2272213): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-007-9084-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2111289093 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the variable ordering of OBDDs is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4885895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Based Algorithms for Boolean Function Manipulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4281560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Boolean manipulation with OBDD's can be extended to FBDD's / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of minimizing and learning OBDDs and FBDDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The nonapproximability of OBDD minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction of OBDDs in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph driven BDDs -- a new data structure for Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4268445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the descriptive and algorithmic power of parity ordered binary decision diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching Programs and Binary Decision Diagrams / rank
 
Normal rank

Latest revision as of 20:19, 1 July 2024

scientific article
Language Label Description Also known as
English
Minimization problems for parity OBDDs
scientific article

    Statements

    Identifiers