Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Michal Rolínek
Even Delta-Matroids and the Complexity of Planar Boolean CSPs
Related publications
Matroids, Delta-Matroids and Embedded Graphs
Journal of Combinatorial Theory - Series A
Combinatorics
Computational Theory
Discrete Mathematics
Theoretical Computer Science
Mathematics
The Monotone Circuit Complexity of Boolean Functions
Combinatorica
Combinatorics
Computational Mathematics
Discrete Mathematics
The Complexity of Reasoning With Boolean Modal Logics
Classes of Boolean Functions With Limited Complexity
Prikladnaya diskretnaya matematika. Prilozhenie
Compiling CSPs: A Complexity Map of (Non-Deterministic) Multivalued Decision Diagrams
On the Complexity of Weakly Positive and Weakly Negative Boolean Functionsreducing
Prikladnaya Diskretnaya Matematika
Signal Processing
Combinatorics
Applied Mathematics
Mathematics
Discrete Mathematics
Computational Theory
Theoretical Computer Science
Borel Complexity of Isomorphism Between Quotient Boolean Algebras
Journal of Symbolic Logic
Philosophy
Logic
Minimizing the Average Query Complexity of Learning Monotone Boolean Functions
INFORMS Journal on Computing
Management Science
Computer Science Applications
Information Systems
Operations Research
Software
Size-Time Complexity of Boolean Networks for Prefix Computations
