scientific article
From MaRDI portal
Publication:3758245
zbMath0621.68034MaRDI QIDQ3758245
Publication date: 1987
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)
Related Items (10)
On hardness of one-way functions ⋮ Representing Groups on Graphs ⋮ Separating the low and high hierarchies by oracles ⋮ Structure in approximation classes ⋮ Confronting intractability via parameters ⋮ On computational complexity and honest polynomial degrees ⋮ Probabilistic complexity classes and lowness ⋮ Computational Complexity of Computing Symmetries in Finite-Domain Planning ⋮ Nonuniform proof systems: A new framework to describe nonuniform and probabilistic complexity classes ⋮ Isomorphic unordered labeled trees up to substitution ciphering
This page was built for publication:
