On the public citation graph
An algorithm to learn read-once threshold formulas, and transformations between learning models
0 signed · 23 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/b978-1-55860-146-8.50034-5openalex-snapshot
Exact Identification of Circuits Using Fixed Points of Amplification Functions
inferredcites →https://doi.org/10.1109/fscs.1990.89538openalex-snapshot
Exact identification of circuits using fixed points of amplification functions
inferredcites →https://doi.org/10.1109/sct.1990.113956openalex-snapshot
On read-once threshold formulae and their randomized decision tree complexity
inferredcites →https://doi.org/10.1145/129712.129747openalex-snapshot
Learning arithmetic read-once formulas
inferredcites →https://doi.org/10.1145/130385.130386openalex-snapshot
Learning Boolean read-once formulas with arbitrary symmetric and constant fan-in gates
inferredcites →https://doi.org/10.1145/138027.138061openalex-snapshot
Learning read-once formulas with queries
inferredcites →https://doi.org/10.1145/168304.168310openalex-snapshot
Asking questions to minimize errors
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-62685-9_5openalex-snapshot
Learning from incomplete boundary queries using split graphs and hypergraphs
inferred← citeshttps://doi.org/10.1007/3-540-63577-7_60openalex-snapshot
On learning disjunctions of zero-one threshold functions with queries
inferred← citeshttps://doi.org/10.1007/978-3-642-40935-6_4openalex-snapshot
Exact Learning from Membership Queries: Some Techniques, Results and New Directions
inferred← citeshttps://doi.org/10.1007/bf01844845openalex-snapshot
Independence and port oracles for matroids, with an application to computational learning theory
inferred← citeshttps://doi.org/10.1007/pl00001593openalex-snapshot
Complexity theoretic hardness results for query learning
inferred← citeshttps://doi.org/10.1007/s10598-011-9090-1openalex-snapshot
Learning read once functions using subcube parity queries
inferred← citeshttps://doi.org/10.1016/0020-0255(96)00082-5openalex-snapshot
Interactive learning of monotone Boolean functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.04.034openalex-snapshot
Exact learning from an honest teacher that answers membership queries
inferred← citeshttps://doi.org/10.1023/a:1007320031970openalex-snapshot
Exact Learning of Formulas in Parallel
inferred← citeshttps://doi.org/10.1023/a:1013641821190openalex-snapshot
Theory Revision with Queries: DNF Formulas
inferred← citeshttps://doi.org/10.1137/s009753979223664xopenalex-snapshot
Learning Arithmetic Read-Once Formulas
inferred← citeshttps://doi.org/10.1137/s009753979528812xopenalex-snapshot
Interpolating Arithmetic Read-Once Formulas in Parallel
inferred← citeshttps://doi.org/10.1145/267460.267504openalex-snapshot
Learning from examples with unspecified attribute values (extended abstract)
inferred← citeshttps://doi.org/10.1145/779928.779949openalex-snapshot
On polynomial-time preference elicitation with value queries
inferred← citeshttps://doi.org/10.48550/arxiv.1007.1073openalex-snapshot
Learning Read-Once Functions Using Subcube Identity Queries
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.