Complexity Considerations, cSAT Lower Bound
From MaRDI portal
Publication:6205211
arXiv0704.0514MaRDI QIDQ6205211
Publication date: 4 April 2007
Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Descriptive complexity and finite models (68Q19)
This page was built for publication: Complexity Considerations, cSAT Lower Bound
