On the public citation graph
Almost Optimal Canonical Property Testers for Satisfiability
0 signed · 31 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.1002/rsa.10041openalex-snapshot
Property testers for dense constraint satisfaction programs on finite domains
inferredcites →https://doi.org/10.1007/978-3-540-74208-1_38openalex-snapshot
On the Benefits of Adaptivity in Property Testing of Dense Graphs
inferredcites →https://doi.org/10.1007/bf02582932openalex-snapshot
On graphs with small subgraphs of large chromatic number
inferredcites →https://doi.org/10.1007/s004930050052openalex-snapshot
Quick Approximation to Matrices and Applications
inferredcites →https://doi.org/10.1016/j.tcs.2004.09.031openalex-snapshot
Testing hypergraph colorability
inferredcites →https://doi.org/10.1016/s0022-0000(03)00008-4openalex-snapshot
Random sampling and approximation of MAX-CSPs
inferredcites →https://doi.org/10.1016/s0167-5060(08)70495-3openalex-snapshot
Extremal Graphs without Large Forbidden Subgraphs
inferredcites →https://doi.org/10.1109/ccc.2004.1313803openalex-snapshot
Lower bounds for testing bipartiteness in dense graphs
inferredcites →https://doi.org/10.1109/sfcs.2001.959922openalex-snapshot
Three theorems regarding testing graph properties
inferredcites →https://doi.org/10.1137/090749621openalex-snapshot
Algorithmic Aspects of Property Testing in the Dense Graphs Model
inferredcites →https://doi.org/10.1137/s009753970444199xopenalex-snapshot
Abstract Combinatorial Programs and Efficient Property Testers
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_7openalex-snapshot
k-Balanced Biclique Partition on Signed Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00037-014-0093-0openalex-snapshot
Testing list H-homomorphisms
inferred← citeshttps://doi.org/10.1007/s00224-021-10047-8openalex-snapshot
Property Testing of the Boolean and Binary Rank
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115410openalex-snapshot
K-balanced biclique partition: Kernelization and efficient algorithms
inferred← citeshttps://doi.org/10.1093/imrn/rny108openalex-snapshot
A Generalized Turán Problem and its Applications
inferred← citeshttps://doi.org/10.1109/focs57990.2023.00109openalex-snapshot
Testing Graph Properties with the Container Method
inferred← citeshttps://doi.org/10.1137/24m1653173openalex-snapshot
Testing Graph Properties with the Container Method
inferred← citeshttps://doi.org/10.1145/3188745.3188778openalex-snapshot
A generalized Turán problem and its applications
inferred← citeshttps://doi.org/10.1145/3294052.3319679openalex-snapshot
Testability of Homomorphism Inadmissibility
inferred← citeshttps://doi.org/10.1145/3543507.3583213openalex-snapshot
Testing Cluster Properties of Signed Graphs
inferred← citeshttps://doi.org/10.1145/3618260.3649708openalex-snapshot
New Graph and Hypergraph Container Lemmas with Applications in Property Testing
inferred← citeshttps://doi.org/10.48550/arxiv.2102.07587openalex-snapshot
Testing properties of signed graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2110.04574openalex-snapshot
A Faster Algorithm for Max Cut in Dense Graphs
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.