Limits to Parallel Computation: P-Completeness Theory

Raymond Greenlaw and H. James Hoover and Walter L. Ruzzo

misc1995

Citation key: GreenlawHooverRuzzo1995
Year: 1995
Cited by: 1 catalog records
Direct source: Available

Reference note

Why this source is in the ledger

Raymond Greenlaw, H. James Hoover, and Walter L. Ruzzo, Limits to Parallel Computation: P-Completeness Theory, Oxford University Press (1995), https://www.cs.cornell.edu/courses/cs5220/2014fa/PCom.pdf.

Catalog connections

Conjectures citing this source

TCS-005 $P$ versus $NC$ Theoretical computer science

Source record

Bibliographic fields

Inspect the parsed BibTeX fields

author: Raymond Greenlaw and H. James Hoover and Walter L. Ruzzo
note: Raymond Greenlaw, H. James Hoover, and Walter L. Ruzzo, Limits to Parallel Computation: P-Completeness Theory, Oxford University Press (1995), https://www.cs.cornell.edu/courses/cs5220/2014fa/PCom.pdf.
title: Limits to Parallel Computation: P-Completeness Theory
url: https://www.cs.cornell.edu/courses/cs5220/2014fa/PCom.pdf
year: 1995