On the public citation graph

Approximating the Tutte polynomial of a binary matroid and other related combinatorial polynomials

0 signed · 39 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/bimj.19660080310openalex-snapshot
Beckenbach, E. F.: (Herausgeber) Applied Combinatorial Mathematics. John Wiley and Sons, Inc., New York‐London‐Sidney, 1964. 608 S., 104 Fig., Preis 102 s
inferredcites →https://doi.org/10.1002/sapm1976552119openalex-snapshot
Weight Enumeration and the Geometry of Linear Codes
inferredcites →https://doi.org/10.1006/inco.1993.1045openalex-snapshot
Automating Pólya Theory: The Computational Complexity of the Cycle Index Polynomial
inferredcites →https://doi.org/10.1007/978-3-642-14165-2_34openalex-snapshot
Approximating the Partition Function of the Ferromagnetic Potts Model
inferredcites →https://doi.org/10.1007/bf02186281openalex-snapshot
Potts models and random-cluster processes with many-body interactions
inferredcites →https://doi.org/10.1007/s00037-012-0046-4openalex-snapshot
Inapproximability of the Tutte polynomial of a planar graph
inferredcites →https://doi.org/10.1007/s00453-003-1073-yopenalex-snapshot
The Relative Complexity of Approximate Counting Problems
inferredcites →https://doi.org/10.1016/0304-3975(86)90174-xopenalex-snapshot
Random generation of combinatorial structures from a uniform distribution
inferredcites →https://doi.org/10.1016/c2013-0-10826-4openalex-snapshot
Graphical Enumeration
inferredcites →https://doi.org/10.1016/j.ic.2008.04.003openalex-snapshot
Inapproximability of the Tutte polynomial
inferredcites →https://doi.org/10.1017/cbo9780511662096openalex-snapshot
Surveys in Combinatorics, 1995
inferredcites →https://doi.org/10.1017/cbo9780511662096.006openalex-snapshot
Computational Pólya theory
inferredcites →https://doi.org/10.1017/cbo9780511734885openalex-snapshot
Surveys in Combinatorics 2005
inferredcites →https://doi.org/10.1017/cbo9780511734885.009openalex-snapshot
The multivariate Tutte polynomial (alias Potts model) for graphs and matroids
inferredcites →https://doi.org/10.1017/cbo9780511813603openalex-snapshot
Probability and Computing
inferredcites →https://doi.org/10.1017/s0305004100068936openalex-snapshot
On the computational complexity of the Jones and Tutte polynomials
inferredcites →https://doi.org/10.1017/s096354830600767xopenalex-snapshot
The Complexity of Ferromagnetic Ising with Local Fields
inferredcites →https://doi.org/10.1080/00401706.1965.10490279openalex-snapshot
Applied Combinatorial Mathematics
inferredcites →https://doi.org/10.1109/focs.2008.40openalex-snapshot
Computing the Tutte Polynomial in Vertex-Exponential Time
inferredcites →https://doi.org/10.1137/0222066openalex-snapshot
Polynomial-Time Approximation Algorithms for the Ising Model
inferredcites →https://doi.org/10.1137/s0097539704446797openalex-snapshot
The Computational Complexity of Tutte Invariants for Planar Graphs
inferredcites →https://doi.org/10.1137/s0097539794266407openalex-snapshot
On Unapproximable Versions of $NP$-Complete Problems
inferredcites →https://doi.org/10.1145/1250790.1250858openalex-snapshot
Inapproximability of the Tutte polynomial
inferredcites →https://doi.org/10.1145/2371656.2371660openalex-snapshot
Approximating the partition function of the ferromagnetic Potts model
inferredcites →https://doi.org/10.2168/lmcs-1(1:5)2005openalex-snapshot
Linear Datalog and Bounded Path Duality of Relational Structures
inferredcites →https://doi.org/10.37236/1663openalex-snapshot
Cycle Index, Weight Enumerator, and Tutte Polynomial

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-3-642-22006-7_44openalex-snapshot
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid
inferred← citeshttps://doi.org/10.1007/978-3-642-31594-7_34openalex-snapshot
The Complexity of Computing the Sign of the Tutte Polynomial (and Consequent #P-hardness of Approximation)
inferred← citeshttps://doi.org/10.1016/j.jcss.2019.12.003openalex-snapshot
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
inferred← citeshttps://doi.org/10.1137/110851213openalex-snapshot
A Polynomial-Time Algorithm for Estimating the Partition Function of the Ferromagnetic Ising Model on a Regular Matroid
inferred← citeshttps://doi.org/10.1137/12088330xopenalex-snapshot
The Complexity of Computing the Sign of the Tutte Polynomial
inferred← citeshttps://doi.org/10.1145/2528401openalex-snapshot
The expressibility of functions on the boolean domain, with applications to counting CSPs
inferred← citeshttps://doi.org/10.1145/2600917openalex-snapshot
The Complexity of Approximately Counting Tree Homomorphisms
inferred← citeshttps://doi.org/10.1145/2601327openalex-snapshot
A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing
inferred← citeshttps://doi.org/10.1145/3313276.3316385openalex-snapshot
Log-concave polynomials II: high-dimensional walks and an FPRAS for counting bases of a matroid
inferred← citeshttps://doi.org/10.26686/wgtn.17005114openalex-snapshot
Matroids, Complexity and Computation
inferred← citeshttps://doi.org/10.26686/wgtn.17005114.v1openalex-snapshot
Matroids, Complexity and Computation
inferred← citeshttps://doi.org/10.4007/annals.2024.199.1.4openalex-snapshot
Log-concave polynomials II: High-dimensional walks and an FPRAS for counting bases of a matroid
inferred← citeshttps://doi.org/10.48550/arxiv.1202.0313openalex-snapshot
The Complexity of Computing the Sign of the Tutte Polynomial
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.