On the public citation graph
Inclusion-exclusion: Exact and approximate
0 signed · 76 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.1007/978-3-319-21852-6_3openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1016/0095-8956(72)90068-8openalex-snapshot
A note on the line reconstruction problem
inferredcites →https://doi.org/10.1016/0095-8956(77)90074-0openalex-snapshot
The edge reconstruction hypothesis is true for graphs with more than n · log2n edges
inferredcites →https://doi.org/10.1016/c2009-0-09109-0openalex-snapshot
Combinatorial Problems and Exercises
inferredcites →https://doi.org/10.1017/s0305004100068857openalex-snapshot
A new method for generating Bonferroni-type inequalities by iteration
inferredcites →https://doi.org/10.1137/1116025openalex-snapshot
On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
inferredcites →https://doi.org/10.1145/103418.103464openalex-snapshot
On deterministic approximation of DNF
inferredcites →https://doi.org/10.1145/195058.195155openalex-snapshot
On the learnability of discrete distributions
inferredcites →https://doi.org/10.5962/bhl.title.29413openalex-snapshot
An Investigation of the Laws of Thought on Which Are Founded the Mathematical Theories of Logic and Probabilities (1854)
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.1007/11970125_3openalex-snapshot
Coping with Interference: From Maximum Coverage to Planning Cellular Networks
inferred← citeshttps://doi.org/10.1007/3-540-45681-3_18openalex-snapshot
Support Approximations Using Bonferroni-Type Inequalities
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-319-44479-6_7openalex-snapshot
Computing the Partition Function of a Polynomial on the Boolean Cube
inferred← citeshttps://doi.org/10.1007/978-3-319-46909-6_2openalex-snapshot
Towards User-Aware Service Composition
inferred← citeshttps://doi.org/10.1007/978-3-540-87877-3_23openalex-snapshot
Approximate Probabilistic Query Answering over Inconsistent Databases
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/bf01200907openalex-snapshot
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
inferred← citeshttps://doi.org/10.1007/s00037-009-0274-4openalex-snapshot
Approximate Inclusion-Exclusion for Arbitrary Symmetric Functions
inferred← citeshttps://doi.org/10.1007/s10618-006-0054-6openalex-snapshot
Non-derivable itemset mining
inferred← citeshttps://doi.org/10.1007/s10661-026-15060-3openalex-snapshot
Methods for estimating status and change in presence and foliar cover area of invasive plants using national forest inventory data
inferred← citeshttps://doi.org/10.1007/s10878-017-0242-xopenalex-snapshot
Reliability evaluation of a multicast over coded packet networks
inferred← citeshttps://doi.org/10.1007/s12243-016-0520-0openalex-snapshot
SecIVo: a quantitative security evaluation framework for internet voting schemes
inferred← citeshttps://doi.org/10.1016/j.dam.2004.06.007openalex-snapshot
Measures on Boolean polynomials and their applications in data mining
inferred← citeshttps://doi.org/10.1016/j.dam.2005.08.005openalex-snapshot
Frequency-based views to pattern collections
inferred← citeshttps://doi.org/10.1016/j.datak.2020.101852openalex-snapshot
An analytical model for information gathering and propagation in social networks using random graphs
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.net.2018.10.012openalex-snapshot
Development of logical structure for multi-unit probabilistic safety assessment
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.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.1017/s1351324910000197openalex-snapshot
Inductive probabilistic taxonomy learning using singular value decomposition
inferred← citeshttps://doi.org/10.1038/s41567-020-01109-8openalex-snapshot
Classical algorithms for quantum mean values
inferred← citeshttps://doi.org/10.1063/5.0113731openalex-snapshot
A construction of combinatorial NLTS
inferred← citeshttps://doi.org/10.1093/ietisy/e88-d.1.100openalex-snapshot
A Note on Approximating Inclusion-Exclusion for k-CNF Formulas
inferred← citeshttps://doi.org/10.1093/jamia/ocac232openalex-snapshot
Modeling the impact of data sharing on variant classification
inferred← citeshttps://doi.org/10.1103/physreva.109.052431openalex-snapshot
Fermionic Hamiltonians without trivial low-energy states
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/aspdac.2014.6742882openalex-snapshot
EUV-CDA: Pattern shift aware critical density analysis for EUV mask layouts
inferred← citeshttps://doi.org/10.1109/focs.2017.10openalex-snapshot
A Nearly Optimal Lower Bound on the Approximate Degree of AC^0
inferred← citeshttps://doi.org/10.1109/icra.2018.8460752openalex-snapshot
Probabilistic Graph Security for Networked Multi-Robot Systems
inferred← citeshttps://doi.org/10.1109/wetice.2016.57openalex-snapshot
Designing a Collaborative Middleware for Semantic and User-Aware Service Composition
inferred← citeshttps://doi.org/10.1115/1.4031906openalex-snapshot
System Reliability Analysis With Dependent Component Failures During Early Design Stage—A Feasibility Study
inferred← citeshttps://doi.org/10.1137/110842661openalex-snapshot
Strong Direct Product Theorems for Quantum Communication and Query Complexity
inferred← citeshttps://doi.org/10.1137/17m1161737openalex-snapshot
A Nearly Optimal Lower Bound on the Approximate Degree of AC$^0$
inferred← citeshttps://doi.org/10.1145/2213977.2214044openalex-snapshot
Making polynomials robust to noise
inferred← citeshttps://doi.org/10.1145/3188745.3188784openalex-snapshot
The polynomial method strikes back: tight quantum query bounds via dual polynomials
inferred← citeshttps://doi.org/10.1145/3375399openalex-snapshot
Linearization of Dependency and Sampling for Participation-based Betweenness Centrality in Very Large B-hypergraphs
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/3564246.3585114openalex-snapshot
NLTS Hamiltonians from Good Quantum Codes
inferred← citeshttps://doi.org/10.1145/3618260.3649687openalex-snapshot
Optimal Non-adaptive Tolerant Junta Testing via Local Estimators
inferred← citeshttps://doi.org/10.2140/iig.2008.6.249openalex-snapshot
On approximate inclusion-exclusion
inferred← citeshttps://doi.org/10.22331/q-2023-05-11-999openalex-snapshot
Concentration bounds for quantum states and limitations on the QAOA from polynomial approximations
inferred← citeshttps://doi.org/10.26421/qic8.10-4openalex-snapshot
A note on quantum algorithms and the minimal degree of epsilon-error polynomials for symmetric functions
inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2019.71openalex-snapshot
Approximate Degree, Secret Sharing, and Concentration Phenomena
inferred← citeshttps://doi.org/10.4230/lipics.approx/random.2022.26openalex-snapshot
Lifting with Inner Functions of Polynomial Discrepancy
inferred← citeshttps://doi.org/10.4230/lipics.itcs.2022.6openalex-snapshot
Circuit Lower Bounds for Low-Energy States of Quantum Code Hamiltonians
inferred← citeshttps://doi.org/10.48550/arxiv.0805.2135openalex-snapshot
Communication Lower Bounds Using Dual Polynomials
inferred← citeshttps://doi.org/10.48550/arxiv.1402.5164openalex-snapshot
Distribution-Independent Reliable Learning
inferred← citeshttps://doi.org/10.61091/ojac-1408openalex-snapshot
Approximating real-rooted and stable polynomials, with combinatorial applications
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.