scientific article; zbMATH DE number 1263190
From MaRDI portal
Publication:4234060
zbMath0968.68532MaRDI QIDQ4234060
Jeff Edmonds, Chung Keung Poon
Publication date: 27 August 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Related Items (2)
Time-space tradeoffs for satisfiability ⋮ Lower bounds on the complexity of recognizing SAT by Turing machines
This page was built for publication: