On the public citation graph

Random Boolean expressions

0 signed · 65 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<103::aid-rsa5>3.0.co;2-zopenalex-snapshot
Systems of functional equations
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199701/03)10:1/2<103::aid-rsa5>3.3.co;2-0openalex-snapshot
Systems of functional equations
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199705)10:3<337::aid-rsa4>3.0.co;2-xopenalex-snapshot
Some typical properties of large AND/OR Boolean formulas
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199707)10:4<453::aid-rsa3>3.0.co;2-topenalex-snapshot
Coloring rules for finite trees, and probabilities of monadic second order sentences
inferredcites →https://doi.org/10.1002/(sici)1098-2418(199810/12)13:3/4<349::aid-rsa9>3.0.co;2-vopenalex-snapshot
The number of Boolean functions computed by formulas of a given size
inferredcites →https://doi.org/10.1002/rsa.20095openalex-snapshot
The Boolean functions computed by random Boolean formulas or how to grow the right function
inferredcites →https://doi.org/10.1002/sapm194221183openalex-snapshot
The Number of Two‐Terminal Series‐Parallel Networks
inferredcites →https://doi.org/10.1007/3-540-27477-4_16openalex-snapshot
The Complexity of Boolean Functions
inferredcites →https://doi.org/10.1007/3-540-60246-1_130openalex-snapshot
Some typical properties of large AND/OR Boolean formulas
inferredcites →https://doi.org/10.1007/978-0-8176-4729-2openalex-snapshot
Mathematics for the Analysis of Algorithms
inferredcites →https://doi.org/10.1007/978-1-4612-4664-0openalex-snapshot
Combinatorial Enumeration of Groups, Graphs, and Chemical Compounds
inferredcites →https://doi.org/10.1007/978-3-540-48115-7_3openalex-snapshot
Probability on Trees: An Introductory Climb
inferredcites →https://doi.org/10.1007/bfb0017174openalex-snapshot
Random boolean formulas representing any boolean function with asymptotically equal probability
inferredcites →https://doi.org/10.1016/0012-365x(90)90223-5openalex-snapshot
Random boolean formulas representing any boolean function with asymptotically equal probability
inferredcites →https://doi.org/10.1016/0196-6774(84)90016-6openalex-snapshot
Short monotone formulae for the majority function
inferredcites →https://doi.org/10.1016/b978-0-12-509850-2.50009-9openalex-snapshot
COUNTING THEOREMS AND THEIR APPLICATIONS TO CLASSIFICATION OF SWITCHING FUNCTIONS
inferredcites →https://doi.org/10.1016/j.entcs.2005.06.022openalex-snapshot
Asymptotic Density for Equivalence
inferredcites →https://doi.org/10.1016/j.tcs.2006.01.002openalex-snapshot
Probability distribution for simple tautologies
inferredcites →https://doi.org/10.1016/s0168-0072(94)90011-6openalex-snapshot
A natural prior probability distribution derived from the propositional calculus
inferredcites →https://doi.org/10.1016/s1571-0661(04)80856-9openalex-snapshot
Statistics of implicational logic
inferredcites →https://doi.org/10.1017/s0960129599002959openalex-snapshot
Statistical properties of simple types
inferredcites →https://doi.org/10.1017/s0963548304006273openalex-snapshot
And/Or Trees Revisited
inferredcites →https://doi.org/10.1017/s0963548304006315openalex-snapshot
Boltzmann Samplers for the Random Generation of Combinatorial Structures
inferredcites →https://doi.org/10.1017/s0963548398003630openalex-snapshot
Complexity and Probability of Some Boolean Formulas
inferredcites →https://doi.org/10.1023/b:stud.0000032101.88511.93openalex-snapshot
Statistics of Intuitionistic versus Classical Logics
inferredcites →https://doi.org/10.1109/9780470544242.ch34openalex-snapshot
The Number of TwoTerminal SeriesParallel Networks
inferredcites →https://doi.org/10.1137/0403019openalex-snapshot
Singularity Analysis of Generating Functions
inferredcites →https://doi.org/10.1137/1.9781611972979.5openalex-snapshot
Boltzmann Sampling of Unlabelled Structures
inferredcites →https://doi.org/10.1201/b19267-16openalex-snapshot
- Analytic combinatorics
inferredcites →https://doi.org/10.1214/aop/1176989012openalex-snapshot
Finite Range Random Walk on Free Groups and Homogeneous Trees
inferredcites →https://doi.org/10.2307/1969046openalex-snapshot
The Number of Trees
inferredcites →https://doi.org/10.2307/3618278openalex-snapshot
Combinatorial Enumeration of Groups, Graphs and Chemical Compounds
inferredcites →https://doi.org/10.3166/jancl.13.391-421openalex-snapshot
On the density of truth of implicational parts of intuitionistic and classical logics
inferredcites →https://doi.org/10.4153/cjm-1978-085-0openalex-snapshot
On the Altitude of Nodes in Random Trees
inferredcites →https://doi.org/10.46298/dmtcs.3500openalex-snapshot
Density of truth in modal logics

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.200810053openalex-snapshot
Tautologies over implication with negative literals
inferred← citeshttps://doi.org/10.1002/rsa.20379openalex-snapshot
The fraction of large random trees representing a given Boolean function in implicational logic
inferred← citeshttps://doi.org/10.1002/rsa.20393openalex-snapshot
The distribution of height and diameter in random non‐plane binary trees
inferred← citeshttps://doi.org/10.1002/rsa.20567openalex-snapshot
A sprouting tree model for random boolean functions
inferred← citeshttps://doi.org/10.1002/rsa.20758openalex-snapshot
And/or trees: A local limit point of view
inferred← citeshttps://doi.org/10.1007/978-3-030-48516-0_13openalex-snapshot
On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations
inferred← citeshttps://doi.org/10.1007/978-3-030-79416-3_12openalex-snapshot
Analysis of an Efficient Reduction Algorithm for Random Regular Expressions Based on Universality Detection
inferred← citeshttps://doi.org/10.1007/978-3-032-05461-6_11openalex-snapshot
On the Potential of Deep Symbolic Models for Classification Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-17142-5_7openalex-snapshot
Asymptotic Properties of Combinatory Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0openalex-snapshot
Arbres pour l’Algorithmique
inferred← citeshttps://doi.org/10.1007/978-3-319-93725-0_3openalex-snapshot
Arbres, algorithmes et données
inferred← citeshttps://doi.org/10.1007/978-3-540-68103-8_7openalex-snapshot
Intuitionistic vs. Classical Tautologies, Quantitative Comparison
inferred← citeshttps://doi.org/10.1007/978-3-540-74915-8_16openalex-snapshot
Classical and Intuitionistic Logic Are Asymptotically Identical
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_28openalex-snapshot
Complexity and Limiting Ratio of Boolean Functions over Implication
inferred← citeshttps://doi.org/10.1007/978-3-642-54423-1_41openalex-snapshot
Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/s11225-008-9110-0openalex-snapshot
Asymptotic Densities in Logic and Type Theory
inferred← citeshttps://doi.org/10.1016/j.apal.2011.09.011openalex-snapshot
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid
inferred← citeshttps://doi.org/10.1016/j.tcs.2014.12.025openalex-snapshot
Associative and commutative tree representations for Boolean functions
inferred← citeshttps://doi.org/10.1080/11663081.2023.2269645openalex-snapshot
Fuzzy logics – quantitatively
inferred← citeshttps://doi.org/10.1093/logcom/exs017openalex-snapshot
How big is BCI fragment of BCK logic
inferred← citeshttps://doi.org/10.1109/fuzz48607.2020.9177858openalex-snapshot
Quantitative Study of Fuzzy Logics
inferred← citeshttps://doi.org/10.1134/s1054661823040077openalex-snapshot
Logic Separation: Discrete Modelling of Pattern Recognition
inferred← citeshttps://doi.org/10.2298/aadm160715015dopenalex-snapshot
The relation between tree size complexity and probability for Boolean functions generated by uniform random trees
inferred← citeshttps://doi.org/10.37236/2402openalex-snapshot
Probabilities of Boolean Functions given by Random Implicational Formulas
inferred← citeshttps://doi.org/10.46298/dmtcs.2784openalex-snapshot
No Shannon effect on probability distributions on Boolean functions induced by random expressions
inferred← citeshttps://doi.org/10.46298/dmtcs.3582openalex-snapshot
Subcritical pattern languages for and/or trees
inferred← citeshttps://doi.org/10.48550/arxiv.1304.5615openalex-snapshot
Catalan satisfiability problem
inferred← citeshttps://doi.org/10.48550/arxiv.1305.0651openalex-snapshot
Associative and commutative tree representations for Boolean functions
inferred← citeshttps://doi.org/10.51408/1963-0098openalex-snapshot
RDNF Oriented Analytics to Random Boolean Functions
inferred← citeshttps://doi.org/10.70675/ce73a4f3z5be9z4ee8z96f8zeab6c61a4477openalex-snapshot
Systèmes de fonctions holonomes : application à la théorie des automates
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.