Login / Signup
The impact of heterogeneity and geometry on the proof complexity of random satisfiability.
Thomas Bläsius
Tobias Friedrich
Andreas Göbel
Jordi Levy
Ralf Rothenberger
Published in:
Random Struct. Algorithms (2023)
Keyphrases
</>
computational complexity
geometry theorem proving
theorem proving
computer vision
random sat
three dimensional
decision procedures
propositional logic
satisfiability problem
phase transition
computational cost
neural network
theorem prover
data sets
np complete
space complexity
case study