# Nonconstructive tools for proving polynomial-time decidability

**Type:** Papers  
**Canonical URL:** https://scholariq.org/papers/nonconstructive-tools-for-proving-polynomial-time-decidability/

## Facts

| Field | Value |
| --- | --- |
| Author Names | Michael R. Fellows,Michael A. Langston |
| Citations | 236 |
| DOI | 10.1145/44483.44491 |
| Fields | Computer Science |
| Open Access | true |
| OA Status | bronze |
| OA URL | https://dl.acm.org/doi/pdf/10.1145/44483.44491 |
| OpenAlex ID | https://openalex.org/W1987092466 |
| Type | article |
| Year | 1988 |

## Paper authors

- [Michael A. Langston](https://scholariq.org/researchers/michael-a-langston/)

## Paper primary topic

- [Formal Methods in Verification](https://scholariq.org/topics/formal-methods-in-verification/)

## Paper topics

- [Formal Methods in Verification](https://scholariq.org/topics/formal-methods-in-verification/)
- [Complexity and Algorithms in Graphs](https://scholariq.org/topics/complexity-and-algorithms-in-graphs/)
- [Advanced Graph Theory Research](https://scholariq.org/topics/advanced-graph-theory-research/)

---
Source: ScholarIQ — public research metadata, principally OpenAlex. See https://scholariq.org/sources/ for provenance and https://scholariq.org/methodology/ for what these figures mean.