Indexed metadata

Ramified Recurrence and Computational Complexity I: Word Recurrence and Poly-time

Daniel Leivant

Source record

Source: Crossref

Published: Jan 1, 1995

DOI: 10.1007/978-1-4612-2566-9_11

Open original source ↗

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Ramified Recurrence and Computational Complexity I: Word Recurrence and Poly-time — Mathematical Frontier Network