Disjoint DNF Tautologies With Conflict Bound Two

Journal on Satisfiability, Boolean Modeling and Computation
doi 10.3233/sat190035
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IOS Press

Related search

Learnability of DNF With Representation-Specific Queries

2013English

Decomposition of a Graph Into Two Disjoint Odd Subgraphs

Graphs and Combinatorics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2018English

Separating Bichromatic Point Sets by Two Disjoint Isothetic Rectangles

Scientia Iranica
2016English

Disjoint Segments With Maximum Density

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

The Two Disjoint Path Problem and Wire Routing Design

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1981English

Finding Two Disjoint Paths in a Network With Normalized Α + -MIN-SUM Objective Function

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Two Node-Disjoint Paths Routing for Energy-Efficiency and Network Reliability

2018English

Disjoint Set Union With Randomized Linking

2013English

The Complexity of DNF of Parities

2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy