Publication:3575996
From MaRDI portal
zbMath1193.03016MaRDI QIDQ3575996
Publication date: 28 July 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAF0101/0.html
Analysis of algorithms and problem complexity (68Q25) Classical propositional logic (03B05) Boolean functions (06E30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items
The fraction of large random trees representing a given Boolean function in implicational logic, On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations, Asymptotic Properties of Combinatory Logic, Intuitionistic vs. Classical Tautologies, Quantitative Comparison, In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid, Fuzzy logics – quantitatively, Simplifications of Uniform Expressions Specified by Systems, Asymptotic densities in logic and type theory, Complexity and Limiting Ratio of Boolean Functions over Implication, Unnamed Item, Associative and commutative tree representations for Boolean functions, Analysis of an efficient reduction algorithm for random regular expressions based on universality detection