Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
The Recursive Constraint Principle: Generalizing Sudoku Cube Validation to Boolean Satisfiability (SAT)
The Recursive Constraint Principle: Generalizing Sudoku Cube Validation to Boolean Satisfiability (SAT)
Fuente:
Zenodo
Saved in:
Bibliographic Details
Main Author:
Nikos Dimitris Fakotakis
Format:
Recurso digital
Published:
Zenodo
2026
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Be the first to leave a comment!
Your Comment
You must be logged in first
Similar Items
GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra
by: Kim, Curie, et al.
Published: (2026)
TurboSAT: Gradient-Guided Boolean Satisfiability Accelerated on GPU-CPU Hybrid System
by: Dai, Steve, et al.
Published: (2025)
Evaluating SAT and SMT Solvers on Large-Scale Sudoku Puzzles
by: Davis, Liam, et al.
Published: (2025)
Satisfiability of Quantified Boolean Announcements
by: van Ditmarsch, Hans, et al.
Published: (2022)
Accelerating Boolean Constraint Propagation for Efficient SAT-Solving on FPGAs
by: Govindasamy, Hariprasadh, et al.
Published: (2024)
