A P-Completeness Result for Visibility Graphs of Simple Polygons

Mathematical Logic Quarterly 46 (3):361-376 (2000)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Small universal families for graphs omitting cliques without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.
Graphs with ∏ 1 0 (K)Y-sections.Boško Živaljević - 1993 - Archive for Mathematical Logic 32 (4):259-273.
Variants of Visibility and their Complexity.Dietmar Schuchardt & Hans-Dietrich Hecker - 1998 - Mathematical Logic Quarterly 44 (4):522-528.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
Completeness: from Gödel to Henkin.Maria Manzano & Enrique Alonso - 2014 - History and Philosophy of Logic 35 (1):1-26.
A completeness result for the simply typed λμ-calculus.Karim Nour & Khelifa Saber - 2010 - Annals of Pure and Applied Logic 161 (1):109-118.

Analytics

Added to PP
2013-12-01

Downloads
7 (#1,281,834)

6 months
2 (#1,015,942)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references