Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Conflict-Driven XOR-Clause Learning

From MaRDI portal
Publication:2843342
Jump to:navigation, search

DOI10.1007/978-3-642-31612-8_29zbMath1273.68322arXiv1407.6571OpenAlexW136158981MaRDI QIDQ2843342

Tero Laitinen, Tommi Junttila, Ilkka Niemelä

Publication date: 12 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.6571



Mathematics Subject Classification ID

Cryptography (94A60) Mechanization of proofs and logical operations (03B35) Complexity of proofs (03F20)


Related Items (2)

A game characterisation of tree-like Q-resolution size ⋮ Logical cryptanalysis with WDSat






This page was built for publication: Conflict-Driven XOR-Clause Learning

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2843342&oldid=15767667"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:20.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki