On the public citation graph

The Boolean functions computed by random Boolean formulas or how to grow the right function

0 signed · 34 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(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/rsa.3240060404openalex-snapshot
Improved boolean formulas for the Ramsey graphs
inferredcites →https://doi.org/10.1002/sapm194221183openalex-snapshot
The Number of Two‐Terminal Series‐Parallel Networks
inferredcites →https://doi.org/10.1007/978-1-4612-0999-7openalex-snapshot
Modular Functions and Dirichlet Series in Number Theory
inferredcites →https://doi.org/10.1007/978-1-4684-9910-0openalex-snapshot
Modular Functions and Dirichlet Series in Number Theory
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/0012-365x(94)00166-gopenalex-snapshot
Bent functions and random boolean formulas
inferredcites →https://doi.org/10.1016/0016-0032(56)90559-2openalex-snapshot
Reliable circuits using less reliable relays
inferredcites →https://doi.org/10.1016/0196-6774(84)90016-6openalex-snapshot
Short monotone formulae for the majority function
inferredcites →https://doi.org/10.1017/s0963548398003630openalex-snapshot
Complexity and Probability of Some Boolean Formulas
inferredcites →https://doi.org/10.1063/1.524313openalex-snapshot
A kernel of Gel’fand–Levitan type for the three-dimensional Schrödinger equation
inferredcites →https://doi.org/10.1109/ee.1938.6431064openalex-snapshot
A symbolic analysis of relay and switching circuits
inferredcites →https://doi.org/10.1109/sfcs.1985.5openalex-snapshot
Amplification of probabilistic boolean formulas
inferredcites →https://doi.org/10.1109/t-aiee.1938.5057767openalex-snapshot
A symbolic analysis of relay and switching circuits
inferredcites →https://doi.org/10.1137/s009753979223633xopenalex-snapshot
Amplification by Read-Once Formulas
inferredcites →https://doi.org/10.1525/9780520319875-014openalex-snapshot
12. The Number of Simplices in a Complex

What points at this work

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

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.1007/11596370_3openalex-snapshot
Query Incentive Networks
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/s00453-016-0119-xopenalex-snapshot
2-Xor Revisited: Satisfiability and Probabilities of Functions
inferred← citeshttps://doi.org/10.1016/j.dam.2017.12.042openalex-snapshot
Enumerating lambda terms by weighted length of their De Bruijn representation
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.1088/1742-5468/2011/04/p04015openalex-snapshot
Parallel complexity of random Boolean circuits
inferred← citeshttps://doi.org/10.1088/1742-6596/233/1/012015openalex-snapshot
On the robustness of random Boolean formulae
inferred← citeshttps://doi.org/10.1088/issn.1742-5468openalex-snapshot
Journal of Statistical Mechanics: Theory and Experiment
inferred← citeshttps://doi.org/10.1103/physreve.82.041112openalex-snapshot
Noisy random Boolean formulae: A statistical physics perspective
inferred← citeshttps://doi.org/10.1103/physrevlett.103.248701openalex-snapshot
Computing with Noise: Phase Transitions in Boolean Formulas
inferred← citeshttps://doi.org/10.1103/physrevlett.125.168301openalex-snapshot
Space of Functions Computed by Deep-Layered Machines
inferred← citeshttps://doi.org/10.1109/laweb.2005.18openalex-snapshot
Incentive Networks
inferred← citeshttps://doi.org/10.1109/sfcs.2005.63openalex-snapshot
Query Incentive Networks
inferred← citeshttps://doi.org/10.1109/tit.2014.2370638openalex-snapshot
On Reliable Computation by Noisy Random Boolean Formulas
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.46298/dmtcs.3475openalex-snapshot
Random Boolean expressions
inferred← citeshttps://doi.org/10.48550/arxiv.1602.08357openalex-snapshot
Cortical Computation via Iterative Constructions
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.