Inapproximability of the Tutte polynomial (Q937302): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2122765404 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q55879601 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: cs/0605140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tutte Polynomial Part I: General Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Multiterminal Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative complexity of approximate counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4521549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Several Graph Augmentation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549645 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of the Jones and Tutte polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-Time Approximation Algorithms for the Ising Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard Enumeration Problems in Geometry and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 6-flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomised Approximation in the Tutte Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Unapproximable Versions of $NP$-Complete Problems / rank
 
Normal rank

Revision as of 13:37, 28 June 2024

scientific article
Language Label Description Also known as
English
Inapproximability of the Tutte polynomial
scientific article

    Statements

    Inapproximability of the Tutte polynomial (English)
    0 references
    0 references
    0 references
    14 August 2008
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references