scientific article; zbMATH DE number 3628391

MaRDI QIDQ4190143zbMATH OpenFDO

Authors Gerd Wechsung

Publication date 1979

zbMATH Keywords

Computational ComplexityCrossing MeasureTwo-Tape Turing Machine

Mathematics Subject Classification ID

Model-theoretic forcing (03C25)

Cited in

(1)

• Complexity of nondeterministic multitape computations based on crossing sequences

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4190143)