scientific article; zbMATH DE number 1560343

zbMATH Open0967.68110MaRDI QIDQ4527194

Richard E. Stearns, Madhav V. Marathe, Harry B. III Hunt

Publication date: 6 September 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

HARD problems

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (1)

Hardness of Easy Problems: Basing Hardness on Popular Conjectures such as the Strong Exponential Time Hypothesis (Invited Talk)

This page was built for publication: