SAT as a programming environment for linear algebra

DOI10.3233/FI-2010-300MaRDI QIDQ3008109zbMATH OpenOpenAlexWikidataFDO

Authors Marian Srebrny, Lidia Stępień

Publication date 14 June 2011

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2010-300

zbMATH Keywords

linear algebrasatisfiabilitydeclarative programmingorthogonal matricesorthogonal groups

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 5241986
• scientific article; zbMATH DE number 7300404
• scientific article; zbMATH DE number 27704
• Number representation of satisfiability
• Solving SAT problems by orthogonal method

Cited in

(2)

• A SAT-based preimage analysis of reduced \textsc{Keccak} hash functions
• scientific article; zbMATH DE number 5241986 (Why is no real title available?)

This page was built for publication: SAT as a programming environment for linear algebra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3008109)