Even Delta-Matroids and the Complexity of Planar Boolean CSPs

doi 10.1137/1.9781611974782.20
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Matroids, Delta-Matroids and Embedded Graphs

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2019English

The Monotone Circuit Complexity of Boolean Functions

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1987English

The Complexity of Reasoning With Boolean Modal Logics

2002English

Classes of Boolean Functions With Limited Complexity

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

Compiling CSPs: A Complexity Map of (Non-Deterministic) Multivalued Decision Diagrams

2012English

On the Complexity of Weakly Positive and Weakly Negative Boolean Functionsreducing

Prikladnaya Diskretnaya Matematika
Signal ProcessingCombinatoricsApplied MathematicsMathematicsDiscrete MathematicsComputational TheoryTheoretical Computer Science
2008English

Borel Complexity of Isomorphism Between Quotient Boolean Algebras

Journal of Symbolic Logic
PhilosophyLogic
2008English

Minimizing the Average Query Complexity of Learning Monotone Boolean Functions

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2002English

Size-Time Complexity of Boolean Networks for Prefix Computations

1987English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy