Cover Image

Boolean Variation and Boolean Logic BackPropagation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Nguyen, Van Minh
Format:	Preprint
Published:	2023
Subjects:	Machine Learning Discrete Mathematics Logic in Computer Science Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On the number of asynchronous attractors in AND-NOT Boolean networks
by: Trinh, Van-Giang, et al.
Published: (2025)

Boolean proportions
by: Antić, Christian
Published: (2021)

Continuous Petri Nets Faithfully Fluidify Most Permissive Boolean Networks
by: Haar, Stefan, et al.
Published: (2025)

The Unit Gap: How Sharing Works in Boolean Circuits
by: Krinkin, Kirill
Published: (2026)

Rank-one Boolean tensor factorization and the multilinear polytope
by: Del Pia, Alberto, et al.
Published: (2022)

Beyond hypergraph acyclicity: limits of tractability for pseudo-Boolean optimization
by: Del Pia, Alberto, et al.
Published: (2024)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
by: Roberson, David E., et al.
Published: (2023)

Rice-like complexity lower bounds for Boolean and uniform automata networks
by: Goubault-Larrecq, Aliénor, et al.
Published: (2024)

The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2023)

Logic-based analogical proportions
by: Antić, Christian
Published: (2024)

The unstable formula theorem revisited via algorithms
by: Malliaris, Maryanthe, et al.
Published: (2022)

Agnostic Online Learning and Excellent Sets
by: Malliaris, Maryanthe, et al.
Published: (2021)

Nested Sequents for Intuitionistic Grammar Logics via Structural Refinement
by: Lyon, Tim S.
Published: (2022)

Convex mixed-integer optimization with Frank-Wolfe methods
by: Hendrych, Deborah, et al.
Published: (2022)

Consistency of P-time event graphs is decidable in polynomial time (extended version)
by: Zorzenon, Davide, et al.
Published: (2023)

Fixed Point Certificates for Reachability and Expected Rewards in MDPs
by: Chatterjee, Krishnendu, et al.
Published: (2025)

Generating realistic patient data
by: Brandt, Tabea, et al.
Published: (2025)

Accelerated Evaluation of Ollivier-Ricci Curvature Lower Bounds: Bridging Theory and Computation
by: Kang, Wonwoo, et al.
Published: (2024)

Tightening the mixed integer linear formulation for the piecewise linear approximation in general dimensions
by: Ploussard, Quentin, et al.
Published: (2025)

An Efficient Computational Framework for Discrete Fuzzy Numbers Based on Total Orders
by: Mir, Arnau, et al.
Published: (2025)

Incremental SAT-Based Enumeration of Solutions to the Yang-Baxter Equation
by: Van Caudenberg, Daimy, et al.
Published: (2025)

First-Order Logic and Twin-Width for Some Geometric Graphs
by: Geniet, Colin, et al.
Published: (2025)

The Binary Linearization Complexity of Pseudo-Boolean Functions
by: Walter, Matthias
Published: (2023)

Arithmetic Circuits and Neural Networks for Regular Matroids
by: Hertrich, Christoph, et al.
Published: (2025)

Neural Networks and (Virtual) Extended Formulations
by: Hertrich, Christoph, et al.
Published: (2024)

A Note on Constructive Canonical Splitter Strategies in Nowhere Dense Graph Classes
by: Fuchser, Janne, et al.
Published: (2025)

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
by: Seppelt, Tim
Published: (2023)

Edge Generation Scheduling for DAG Tasks Using Deep Reinforcement Learning
by: Sun, Binqi, et al.
Published: (2023)

Decomposition Polyhedra of Piecewise Linear Functions
by: Brandenburg, Marie-Charlotte, et al.
Published: (2024)

Unrealized Expectations: Comparing AI Methods vs Classical Algorithms for Maximum Independent Set
by: Wu, Yikai, et al.
Published: (2025)

Advances in Algorithmic Meta Theorems
by: Siebertz, Sebastian, et al.
Published: (2024)

Separability Properties of Monadically Dependent Graph Classes
by: Bonnet, Édouard, et al.
Published: (2025)

Existential Positive Transductions of Sparse Graphs
by: Mählmann, Nikolas, et al.
Published: (2026)

Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)

Decomposition horizons and a characterization of stable hereditary classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Epsilon-saturation for stable graphs and Littlestone classes
by: Malliaris, Maryanthe, et al.
Published: (2025)

On first-order transductions of classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
by: Mählmann, Nikolas
Published: (2025)

Flip-Breakability: A Combinatorial Dichotomy for Monadically Dependent Graph Classes
by: Dreier, Jan, et al.
Published: (2024)

Learning Foundations Beneath the Stars
by: Cardone, Felice, et al.
Published: (2026)