共 50 条
- [42] On the properties of asymptotic probability for random Boolean expression values in binary bases STOCHASTIC ALGORITHMS: FOUNDATIONS AND APPLICATIONS, PROCEEDINGS, 2005, 3777 : 202 - 212
- [46] Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2015, PT II, 2015, 9235 : 223 - 234
- [48] Maximal and Premaximal Paraconsistency in the Framework of Three-Valued Semantics Studia Logica, 2011, 97 : 31 - 60
- [50] New Lower Bounds for Polynomial Calculus over Non-Boolean Bases Leibniz Int. Proc. Informatics, LIPIcs,