scientific article; zbMATH DE number 7310062
From MaRDI portal
Publication:5150405
zbMath1477.68188MaRDI QIDQ5150405
No author found.
Publication date: 15 February 2021
Full work available at URL: http://mathnet.ru/eng/pdm263
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nonnumerical algorithms (68W05) Combinatorics in computer science (68R05) Cryptography (94A60) Boolean programming (90C09) Software, source code, etc. for problems pertaining to computer science (68-04) Boolean functions (94D10) Computational aspects of satisfiability (68R07)
Related Items (5)
On a class of decision diagrams ⋮ Unnamed Item ⋮ Transalg ⋮ Unnamed Item ⋮ Study of discrete automaton models of gene networks of nonregular structure using symbolic calculations
Uses Software
Cites Work
- Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
- SAT-Based Scalable Formal Verification Solutions
- The complexity of theorem-proving procedures
- Computability of Recursive Functions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: