scientific article; zbMATH DE number 1263189
From MaRDI portal
Publication:4234059
zbMath0978.68525MaRDI QIDQ4234059
Publication date: 29 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Theory of programming languages (68N15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (13)
Equivalence classes and conditional hardness in massively parallel computations ⋮ The complexity of planarity testing ⋮ The complexity of pure literal elimination ⋮ The complexity of the characteristic and the minimal polynomial. ⋮ Completeness results for graph isomorphism. ⋮ Unnamed Item ⋮ A sorting network in bounded arithmetic ⋮ The isomorphism problem for planar 3-connected graphs is in unambiguous logspace ⋮ On the reducibility of sets inside NP to sets with low information content ⋮ Quantum simulations of classical random walks and undirected graph connectivity ⋮ On the complexity of matrix rank and rigidity ⋮ Unnamed Item ⋮ Planar and grid graph reachability problems
This page was built for publication:
