On the public citation graph

Approximate Inclusion-Exclusion

https://doi.org/10.1007/bf02128670
0 signed · 102 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.1016/0304-3975(79)90044-6openalex-snapshot
The Complexity of Computing the Permanent
inferredcites →https://doi.org/10.1080/00401706.1970.10488686openalex-snapshot
An Introduction to the Approximation of Functions
inferredcites →https://doi.org/10.1080/01621459.1975.10479893openalex-snapshot
Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems
inferredcites →https://doi.org/10.1109/sfcs.1985.19openalex-snapshot
Deterministic simulation of probabilistic constant depth circuits
inferredcites →https://doi.org/10.1109/sfcs.1988.21916openalex-snapshot
Hardness vs. randomness
inferredcites →https://doi.org/10.1287/opre.36.1.145openalex-snapshot
Boole-Bonferroni Inequalities and Linear Programming
inferredcites →https://doi.org/10.5948/upo9781614440147openalex-snapshot
Combinatorial Mathematics

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.10083openalex-snapshot
Deterministic approximation of the cover time
inferred← citeshttps://doi.org/10.1002/rsa.20329openalex-snapshot
The maximal probability that k‐wise independent bits are all 1
inferred← citeshttps://doi.org/10.1002/scj.4690270602openalex-snapshot
Approximation of the size of the union
inferred← citeshttps://doi.org/10.1006/aama.1997.0568openalex-snapshot
Aq-Analog of Approximate Inclusion–Exclusion
inferred← citeshttps://doi.org/10.1007/10719839_29openalex-snapshot
Determining the Optimal Contrast for Secret Sharing Schemes in Visual Cryptography
inferred← citeshttps://doi.org/10.1007/11579427_14openalex-snapshot
Geometric Aspects Related to Solutions of #kSAT
inferred← citeshttps://doi.org/10.1007/11615576_16openalex-snapshot
Boolean Formulas and Frequent Sets
inferred← citeshttps://doi.org/10.1007/11750321_42openalex-snapshot
On PAC Learning Algorithms for Rich Boolean Function Classes
inferred← citeshttps://doi.org/10.1007/11970125_3openalex-snapshot
Coping with Interference: From Maximum Coverage to Planning Cellular Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-19647-3_22openalex-snapshot
Approximate Model Counting via Extension Rule
inferred← citeshttps://doi.org/10.1007/978-3-642-03685-9_30openalex-snapshot
On the Security of Goldreich’s One-Way Function
inferred← citeshttps://doi.org/10.1007/978-3-642-15369-3_38openalex-snapshot
Improved Pseudorandom Generators for Depth 2 Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-20712-9_13openalex-snapshot
Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas
inferred← citeshttps://doi.org/10.1007/978-3-642-31149-9_28openalex-snapshot
Computing #2SAT and #2UNSAT by Binary Patterns
inferred← citeshttps://doi.org/10.1007/978-3-662-53015-3_21openalex-snapshot
Bounded Indistinguishability and the Complexity of Recovering Secrets
inferred← citeshttps://doi.org/10.1007/978-981-99-0151-7_5openalex-snapshot
Some Cardinal Estimations via the Inclusion-Exclusion Principle in Finite $$T_0$$ Topological Spaces
inferred← citeshttps://doi.org/10.1007/bf00881841openalex-snapshot
Resolving contradictions: A plausible semantics for inconsistent systems
inferred← citeshttps://doi.org/10.1007/bf01206321openalex-snapshot
Pseudorandom generators and learning algorithms forAC 0
inferred← citeshttps://doi.org/10.1007/bf01268144openalex-snapshot
Evaluating spectral norms for constant depth circuits with symmetric gates
inferred← citeshttps://doi.org/10.1007/bf01271266openalex-snapshot
Inclusion-exclusion: Exact and approximate
inferred← citeshttps://doi.org/10.1007/bf01940873openalex-snapshot
On deterministic approximation of DNF
inferred← citeshttps://doi.org/10.1007/bfb0045084openalex-snapshot
Contrast-optimal k out of n secret sharing schemes in visual cryptography
inferred← citeshttps://doi.org/10.1007/bfb0053419openalex-snapshot
Visual cryptography
inferred← citeshttps://doi.org/10.1007/s00037-009-0274-4openalex-snapshot
Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions
inferred← citeshttps://doi.org/10.1007/s00037-012-0051-7openalex-snapshot
Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields
inferred← citeshttps://doi.org/10.1007/s00037-013-0068-6openalex-snapshot
DNF sparsification and a faster deterministic counting algorithm
inferred← citeshttps://doi.org/10.1007/s00037-021-00211-4openalex-snapshot
The hardest halfspace
inferred← citeshttps://doi.org/10.1007/s00224-016-9680-6openalex-snapshot
Small-Bias is Not Enough to Hit Read-Once CNF
inferred← citeshttps://doi.org/10.1007/s10115-013-0656-4openalex-snapshot
An approach of support approximation to discover frequent patterns from concept-drifting data streams based on concept learning
inferred← citeshttps://doi.org/10.1007/s10618-014-0362-1openalex-snapshot
On measuring similarity for sequences of itemsets
inferred← citeshttps://doi.org/10.1007/s12652-020-02606-7openalex-snapshot
DEFECT: discover and eradicate fool around node in emergency network using combinatorial techniques
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90160-wopenalex-snapshot
Counting propositional models
inferred← citeshttps://doi.org/10.1016/0888-613x(95)00112-topenalex-snapshot
Exploiting case-based independence for approximating marginal probabilities
inferred← citeshttps://doi.org/10.1016/j.datak.2007.10.003openalex-snapshot
Discovering frequent itemsets by support approximation and itemset clustering
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.06.003openalex-snapshot
Using Binary Patterns for Counting Falsifying Assignments of Conjunctive Forms
inferred← citeshttps://doi.org/10.1016/j.eswa.2009.04.053openalex-snapshot
Discovering frequent itemsets over transactional data streams through an efficient and stable approximate approach
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.04.167openalex-snapshot
An adaptive approximation method to discover frequent itemsets over sliding-window-based data streams
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.09.008openalex-snapshot
An efficient and flexible algorithm for online mining of large itemsets
inferred← citeshttps://doi.org/10.1016/j.jcss.2003.07.007openalex-snapshot
Learning DNF in time 2Õ(n1/3)
inferred← citeshttps://doi.org/10.1016/j.jcss.2018.04.006openalex-snapshot
AC0∘MOD2 lower bounds for the Boolean Inner Product
inferred← citeshttps://doi.org/10.1016/j.jss.2012.01.024openalex-snapshot
Mining frequent patterns from dynamic data streams with data load management
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.05.018openalex-snapshot
On PAC learning algorithms for rich Boolean function classes
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.04.047openalex-snapshot
Two approximate algorithms for model counting
inferred← citeshttps://doi.org/10.1016/s0020-0190(03)00259-xopenalex-snapshot
Inclusion–exclusion for k-CNF formulas
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00048-0openalex-snapshot
A note on approximate inclusion-exclusion
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00243-1openalex-snapshot
Contrast-optimal k out of n secret sharing schemes in visual cryptography
inferred← citeshttps://doi.org/10.1017/9781108277457.014openalex-snapshot
Bibliography and further directions
inferred← citeshttps://doi.org/10.1017/s0963548300001917openalex-snapshot
An Almost m-wise Independent Random Permutation of the Cube
inferred← citeshttps://doi.org/10.1017/s096354831400042xopenalex-snapshot
Simplifying Inclusion–Exclusion Formulas
inferred← citeshttps://doi.org/10.1017/s0963548326100492openalex-snapshot
Computing the probability of intersection
inferred← citeshttps://doi.org/10.1038/s41567-020-01109-8openalex-snapshot
Classical algorithms for quantum mean values
inferred← citeshttps://doi.org/10.1080/095281300146326openalex-snapshot
Explaining by evidence
inferred← citeshttps://doi.org/10.1080/09528139408953787openalex-snapshot
Information and evidence in logic systems
inferred← citeshttps://doi.org/10.1080/09528139508953817openalex-snapshot
Is there an alternative to parsimonious semantics?
inferred← citeshttps://doi.org/10.1109/18.887892openalex-snapshot
Validation of nearest neighbor classifiers
inferred← citeshttps://doi.org/10.1109/3468.686701openalex-snapshot
Deterministic approximation of marginal probabilities in Bayes nets
inferred← citeshttps://doi.org/10.1109/aero.2015.7119021openalex-snapshot
SMART: A propositional logic-based trade analysis and risk assessment tool for a complex mission
inferred← citeshttps://doi.org/10.1109/ccc.1999.766279openalex-snapshot
Learning DNF by approximating inclusion-exclusion formulae
inferred← citeshttps://doi.org/10.1109/ccc.2009.35openalex-snapshot
Poly-logarithmic Independence Fools AC^0 Circuits
inferred← citeshttps://doi.org/10.1109/ccc.2012.38openalex-snapshot
DNF Sparsification and a Faster Deterministic Counting Algorithm
inferred← citeshttps://doi.org/10.1109/focs.2007.28openalex-snapshot
Polylogarithmic Independence Can Fool DNF Formulas
inferred← citeshttps://doi.org/10.1109/focs.2007.55openalex-snapshot
Smooth Histograms for Sliding Windows
inferred← citeshttps://doi.org/10.1109/focs.2009.68openalex-snapshot
Bounded Independence Fools Halfspaces
inferred← citeshttps://doi.org/10.1109/focs.2010.72openalex-snapshot
Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields
inferred← citeshttps://doi.org/10.1109/focs.2016.57openalex-snapshot
Polynomial Representations of Threshold Functions and Algorithmic Applications
inferred← citeshttps://doi.org/10.1109/fskd.2011.6019707openalex-snapshot
A load shedding scheme for frequent pattern mining in transactional data streams
inferred← citeshttps://doi.org/10.1109/fskd.2012.6234217openalex-snapshot
Using count prediction techniques for mining frequent patterns in transactional data streams
inferred← citeshttps://doi.org/10.1109/isda.2008.74openalex-snapshot
An Efficient Approximate Approach to Mining Frequent Itemsets over High Speed Transactional Data Streams
inferred← citeshttps://doi.org/10.1109/tit.2011.2180887openalex-snapshot
Validation of $k$-Nearest Neighbor Classifiers
inferred← citeshttps://doi.org/10.1137/070691954openalex-snapshot
Polylogarithmic Independence Can Fool DNF Formulas
inferred← citeshttps://doi.org/10.1137/100783030openalex-snapshot
Bounded Independence Fools Halfspaces
inferred← citeshttps://doi.org/10.1137/19m1278831openalex-snapshot
Algorithmic Polynomials
inferred← citeshttps://doi.org/10.1137/19m1294162openalex-snapshot
On the Probabilistic Degrees of Symmetric Boolean Functions
inferred← citeshttps://doi.org/10.1137/s089548019223872xopenalex-snapshot
Chernoff–Hoeffding Bounds for Applications with Limited Independence
inferred← citeshttps://doi.org/10.1145/1490270.1490273openalex-snapshot
A Simple Proof of Bazzi’s Theorem
inferred← citeshttps://doi.org/10.1145/1754399.1754401openalex-snapshot
Polylogarithmic independence fools AC 0 circuits
inferred← citeshttps://doi.org/10.1145/1806689.1806711openalex-snapshot
BQP and the polynomial hierarchy
inferred← citeshttps://doi.org/10.1145/1924421.1924445openalex-snapshot
Patterns hidden from simple algorithms
inferred← citeshttps://doi.org/10.1145/1924421.1924446openalex-snapshot
Poly-logarithmic independence fools bounded-depth boolean circuits
inferred← citeshttps://doi.org/10.1145/2213977.2214044openalex-snapshot
Making polynomials robust to noise
inferred← citeshttps://doi.org/10.1145/3366700openalex-snapshot
Fundamental Limits of Approximate Gradient Coding
inferred← citeshttps://doi.org/10.1145/3393691.3394188openalex-snapshot
Fundamental Limits of Approximate Gradient Coding
inferred← citeshttps://doi.org/10.1145/3519935.3519962openalex-snapshot
An area law for 2d frustration-free spin systems
inferred← citeshttps://doi.org/10.1145/3519935.3520000openalex-snapshot
The approximate degree of DNF and CNF formulas
inferred← citeshttps://doi.org/10.1145/3618260.3649687openalex-snapshot
Optimal Non-adaptive Tolerant Junta Testing via Local Estimators
inferred← citeshttps://doi.org/10.1214/ecp.v7-1050openalex-snapshot
Inclusion-Exclusion Redux
inferred← citeshttps://doi.org/10.1515/dmvm-2005-0020openalex-snapshot
Zentralblatt MATH-Konsortium der DMV
inferred← citeshttps://doi.org/10.1561/0400000010openalex-snapshot
Pseudorandomness
inferred← citeshttps://doi.org/10.17760/d20486921openalex-snapshot
On approximating by polynomials and several related models
inferred← citeshttps://doi.org/10.2140/iig.2008.6.249openalex-snapshot
On approximate inclusion-exclusion
inferred← citeshttps://doi.org/10.3390/cryptography2040028openalex-snapshot
A (k, n)-Threshold Progressive Visual Secret Sharing without Expansion
inferred← citeshttps://doi.org/10.4086/toc.2013.v009a007openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2013.v009a020openalex-snapshot
inferred← citeshttps://doi.org/10.4086/toc.2022.v018a004openalex-snapshot
inferred← citeshttps://doi.org/10.5555/313559.313797openalex-snapshot
Chernoff-Hoeffding bounds for applications with limited independence
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.