On the public citation graph

On P versus NP∩co-NP for decision trees and read-once branching programs

https://doi.org/10.1007/bfb0029975
0 signed · 29 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.1007/3-540-54458-5_49openalex-snapshot
Lower bounds for deterministic and nondeterministic branching programs
inferredcites →https://doi.org/10.1007/bf01305953openalex-snapshot
On the size of a blocking set inPG(2,p)
inferredcites →https://doi.org/10.1007/bf02125350openalex-snapshot
Query complexity, or why is it difficult to separateNP A ∩coNP A fromP A by random oraclesA?
inferredcites →https://doi.org/10.1016/0168-0072(83)90038-6openalex-snapshot
∑11-Formulae on finite structures
inferredcites →https://doi.org/10.1016/0304-3975(88)90166-1openalex-snapshot
Entropy of contact circuits and lower bounds on their complexity
inferredcites →https://doi.org/10.1016/0890-5401(89)90001-1openalex-snapshot
Learning decision trees from random examples
inferredcites →https://doi.org/10.1016/s0020-0190(97)00041-0openalex-snapshot
A simple function that requires exponential size read-once branching programs
inferredcites →https://doi.org/10.1090/s0002-9904-1970-12470-3openalex-snapshot
Baer subplanes and blocking sets
inferredcites →https://doi.org/10.1109/sfcs.1981.35openalex-snapshot
Parity, circuits, and the polynomial-time hierarchy
inferredcites →https://doi.org/10.1109/sfcs.1985.49openalex-snapshot
Separating the polynomial-time hierarchy by oracles
inferredcites →https://doi.org/10.1109/sfcs.1986.44openalex-snapshot
Probabilistic Boolean decision trees and the complexity of evaluating game trees
inferredcites →https://doi.org/10.1109/sfcs.1987.30openalex-snapshot
Generic oracles and oracle classes
inferredcites →https://doi.org/10.1109/sfcs.1989.63537openalex-snapshot
Constant depth circuits, Fourier transform, and learnability
inferredcites →https://doi.org/10.1145/103418.103466openalex-snapshot
Learning decision trees using the Fourier spectrum
inferredcites →https://doi.org/10.1145/12130.12132openalex-snapshot
Almost optimal lower bounds for small depth circuits

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jcss.2001.1818openalex-snapshot
Lower Bounds for Linearly Transformed OBDDs and FBDDs
inferred← citeshttps://doi.org/10.1007/3-540-44612-5_60openalex-snapshot
A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_29openalex-snapshot
Lower Bounds for Linear Transformed OBDDs and FBDDs
inferred← citeshttps://doi.org/10.1007/3-540-49116-3_46openalex-snapshot
On the Size of Randomized OBDDs and Read-Once Branching Programs for k-Stable Functions
inferred← citeshttps://doi.org/10.1007/978-3-322-84823-9_19openalex-snapshot
Komplexitätstheoretische Ergebnisse für Randomisierte Branchingprogramme
inferred← citeshttps://doi.org/10.1007/978-3-540-87987-9_29openalex-snapshot
Finding the Rare Cube
inferred← citeshttps://doi.org/10.1007/bfb0028553openalex-snapshot
Lower bounds for randomized read-k-times branching programs
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00445-6openalex-snapshot
Interpolation of the discrete logarithm in Fq by Boolean functions and by polynomials in several variables modulo a divisor of q−1
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00216-4openalex-snapshot
On BPP versus NP∪coNP for ordered read-once branching programs
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00568-6openalex-snapshot
Approximation of boolean functions by combinatorial rectangles
inferred← citeshttps://doi.org/10.1109/sfcs.2000.892112openalex-snapshot
Testing of function that have small width branching programs
inferred← citeshttps://doi.org/10.1137/1.9781611977554.ch107openalex-snapshot
Query Complexity of Inversion Minimization on Trees
inferred← citeshttps://doi.org/10.1137/s009753970038211xopenalex-snapshot
Testing Membership in Languages that Have Small Width Branching Programs
inferred← citeshttps://doi.org/10.3233/sat190035openalex-snapshot
Disjoint DNF Tautologies with Conflict Bound Two
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.