scientific article; zbMATH DE number 3566171
From MaRDI portal
Publication:4138137
zbMath0363.68066MaRDI QIDQ4138137
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99)
Related Items (10)
Smaller superconcentrators of density 28 ⋮ The complexity of testing whether a graph is a superconcentrator ⋮ Size bounds for superconcentrators ⋮ Space bounds for a game on graphs ⋮ Lower bounds for matrix factorization ⋮ A super-quadratic lower bound for depth four arithmetic circuits ⋮ Lower bounds for matrix factorization ⋮ Size-space tradeoffs for oblivious computations ⋮ Rounds versus time for the two person pebble game ⋮ Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization
This page was built for publication:
