The complexity of the fermionant, and immanants of constant width

P. Martin, Enumérations eulériennes dans les multigraphes et invariants de Tutte-Grothendieck. Thesis, Grenoble 1977

1977

Earlier work this paper cites.

P. Rosenstiehl and R. C. Read, On the principal edge tripartition of a graph. Annals of Discrete Mathematics 3:195–226 (1978)

1978

Earlier work this paper cites.

Leslie G. Valiant, The complexity of computing the permanent. Theoretical Computer Science 8:189–201 (1979)

1979

Earlier work this paper cites.

Michel Las Vergnas, On Eulerian partitions of graphs. Research Notes in Mathematics 34, 62–75 (1979)

1979

Earlier work this paper cites.

W. Hartmann, On the complexity of immanants. Linear and Multilinear Algebra 18:127–140 (1985),

1985

Earlier work this paper cites.

Leslie G. Valiant and Vijay V. Vazirani, NP is as Easy as Detecting Unique Solutions. Theor. Comp. Sci. 47(3): 85–93 (1986)

1986

Earlier work this paper cites.

F. Jaeger, On Tutte polynomials and cycles of plane graphs. J. Combinatorial Theory, Series B 44, 127–146 (1988)

1988

Earlier work this paper cites.

Michel Las Vergnas, On the evaluation at ( 3 , 3 ) (3,3) of the Tutte polynomial of a graph. J. Combinatorial Theory, Series B 44, 367–372 (1988)

1988

Earlier work this paper cites.

A. Barvinok, Computational complexity of immanants and representations of the full linear group. Funct. Anal. Appl. 24:144–145 (1990)

1990

Cited alongside, same era.

André Bouchet, Tutte-Martin polynomials and orienting vectors of isotropic systems. Graphs Combin. 7(3) 235–252 (1991)

1991

Cited alongside, same era.

Seinosuke Toda, PP is as Hard as the Polynomial-Time Hierarchy. SIAM J. Comput. 20(5):865–877 (1991)

1991

Cited alongside, same era.

David Zuckerman, On Unapproximable Versions of NP-Complete Problems. SIAM J. Comput. 25(6):1293–1304 (1996)

1996

Cited alongside, same era.

Joanna A. Ellis-Monaghan, New results for the Martin polynomial. J. Combinatorial Theory, Series B 74, 326–352 (1998)

1998

Cited alongside, same era.

William Fulton and Joe Harris, Representation Theory: A First Course. Springer Verlag, 2004

2004

Later among the works it cites.

G. R. Brightwell and P. Winkler, Counting Eulerian circuits is #P-complete. Proc. 7th ALENEX & 2nd ANALCO 259–262 (2005)

2005

Later among the works it cites.

Leslie G. Valiant, Completeness for Parity Problems. Proc. 11th COCOON, 1–8 (2005)

2005

Later among the works it cites.

Dirk Vertigan, The Computational Complexity of Tutte Invariants for Planar Graphs. SIAM J. Comput. , 35(3) 690–712 (2006)

2006

Later among the works it cites.

Andrea Austin, The Circuit Partition Polynomial with Applications and Relation to the Tutte and Interlace Polynomials. Rose-Hulman Undergraduate Mathematics Journal , 8(2) (2007)

2007

Later among the works it cites.