The Extremal Permanental Sum for a Quasi-Tree Graph

Complexity 2019:1-4 (2019)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Canonical simplification of finite objects, well quasi-ordered by tree embedding.Thomas C. Brown - 1979 - Urbana, Ill.: Dept. of Computer Science, University of Illinois at Urbana-Champaign.
König's Infinity Lemma and Beth's Tree Theorem.George Weaver - 2017 - History and Philosophy of Logic 38 (1):48-56.
Feasible graphs with standard universe.Douglas Cenzer & Jeffrey B. Remmel - 1998 - Annals of Pure and Applied Logic 94 (1-3):21-35.
A graph-theoretic analysis of the semantic paradoxes.Timo Beringer & Thomas Schindler - 2017 - Bulletin of Symbolic Logic 23 (4):442-492.
Random generations of the countable random graph.Su Gao & A. Vershik - 2006 - Annals of Pure and Applied Logic 143 (1-3):79-86.
Isomorphisms and nonisomorphisms of graph models.Harold Schellinx - 1991 - Journal of Symbolic Logic 56 (1):227-249.
Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.

Analytics

Added to PP
2019-05-22

Downloads
11 (#1,113,583)

6 months
1 (#1,516,429)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations