Used together with:
unless
(1)
collaps
(1)
size
(1)
subexponenti
(1)
has
(1)
Stem
nonisomorph$ (
all stems
)
1 papers:
STOC-1999-KlivansM
#graph
#morphism
#polynomial
#proving
Graph Nonisomorphism has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses (
AK
,
DvM
), pp. 659–667.
Bibliography of Software Language Engineering in Generated Hypertext
(
BibSLEIGH
) is created and maintained by
Dr. Vadim Zaytsev
.
Hosted as a part of
SLEBOK
on
GitHub
.