On the public citation graph

Property testers for dense constraint satisfaction programs on finite domains

0 signed · 30 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.1002/(sici)1098-2418(199605)8:3<187::aid-rsa3>3.0.co;2-uopenalex-snapshot
MAX-CUT has a randomized approximation scheme in dense graphs
inferredcites →https://doi.org/10.1006/jcss.1998.1605openalex-snapshot
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
inferredcites →https://doi.org/10.1007/3-540-49543-6_28openalex-snapshot
Sampling Methods Applied to Dense Instances of Non-Boolean Optimization Problems
inferredcites →https://doi.org/10.1007/978-1-4612-0865-5_26openalex-snapshot
Probability Inequalities for sums of Bounded Random Variables
inferredcites →https://doi.org/10.1007/978-3-662-03088-2_3openalex-snapshot
Computational Complexity
inferredcites →https://doi.org/10.1007/s004930050052openalex-snapshot
Quick Approximation to Matrices and Applications
inferredcites →https://doi.org/10.1017/cbo9780511814075openalex-snapshot
Randomized Algorithms
inferredcites →https://doi.org/10.1080/01621459.1963.10500830openalex-snapshot
Probability Inequalities for Sums of Bounded Random Variables
inferredcites →https://doi.org/10.1137/s0097539793255151openalex-snapshot
Robust Characterizations of Polynomials with Applications to Program Testing
inferredcites →https://doi.org/10.1137/s0097539797328847openalex-snapshot
Gadgets, Approximation, and Linear Programming
inferredcites →https://doi.org/10.1145/278298.278306openalex-snapshot
Proof verification and the hardness of approximation problems
inferredcites →https://doi.org/10.1145/285055.285060openalex-snapshot
Property testing and its connection to learning and approximation
inferredcites →https://doi.org/10.1145/301250.301267openalex-snapshot
Fast approximate PCPs
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures

What points at this work

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

inferred← citeshttps://doi.org/10.1016/j.cosrev.2025.100806openalex-snapshot
Polynomial property testing
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.09.031openalex-snapshot
Testing hypergraph colorability
inferred← citeshttps://doi.org/10.1016/s0022-0000(03)00008-4openalex-snapshot
Random sampling and approximation of MAX-CSPs
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00019-1openalex-snapshot
Testing satisfiability
inferred← citeshttps://doi.org/10.1109/ccc.2011.10openalex-snapshot
Lower Bounds on Query Complexity for Testing Bounded-Degree CSPs
inferred← citeshttps://doi.org/10.1109/focs.2007.11openalex-snapshot
Non-Preemptive Min-Sum Scheduling with Resource Augmentation
inferred← citeshttps://doi.org/10.1109/focs.2012.59openalex-snapshot
Almost Optimal Canonical Property Testers for Satisfiability
inferred← citeshttps://doi.org/10.1137/080717584openalex-snapshot
Approximate Hypergraph Partitioning and Applications
inferred← citeshttps://doi.org/10.1137/1.9781611976465.29openalex-snapshot
Treewidth-Pliability and PTAS for Max-CSPs
inferred← citeshttps://doi.org/10.1137/1.9781611976465.98openalex-snapshot
On Efficient Distance Approximation for Graph Properties
inferred← citeshttps://doi.org/10.1145/1806689.1806691openalex-snapshot
Spectral methods for matrices and tensors
inferred← citeshttps://doi.org/10.1145/1993636.1993725openalex-snapshot
Optimal constant-time approximation algorithms and (unconditional) inapproximability results for every bounded-degree CSP
inferred← citeshttps://doi.org/10.1145/3543507.3583213openalex-snapshot
Testing Cluster Properties of Signed Graphs
inferred← citeshttps://doi.org/10.1145/3626515openalex-snapshot
Pliability and Approximating Max-CSPs
inferred← citeshttps://doi.org/10.48550/arxiv.1004.1253openalex-snapshot
Spectral Methods for Matrices and Tensors
inferred← citeshttps://doi.org/10.48550/arxiv.2102.07587openalex-snapshot
Testing properties of signed 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.