Complexity and Probability of Some Boolean Formulas
Combinatorics, Probability and Computing
Combinatorics, Probability and Computing
The Boolean functions computed by random Boolean formulas or how to grow the right function
Random Structures & Algorithms
Complexity and Limiting Ratio of Boolean Functions over Implication
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Intuitionistic vs. classical tautologies, quantitative comparison
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
The fraction of large random trees representing a given Boolean function in implicational logic
Random Structures & Algorithms
The distribution of height and diameter in random non-plane binary trees
Random Structures & Algorithms
Classical and intuitionistic logic are asymptotically identical
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Hi-index | 0.00 |