scientific article; zbMATH DE number 3909742

MaRDI QIDQ3686041zbMATH OpenFDO

Authors Lothar Budach

Publication date 1985

zbMATH Keywords

classificationdeterministic complexitylanguage recognitionnon-deterministic complexityspace complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of questionnaires (94A50)

Recommendations

• scientific article; zbMATH DE number 3944411
• Eine Klasse von Abzählproblemen
• Eine Bemerkung über die Klassenzahl der absoluten Klassenkörper
• scientific article; zbMATH DE number 3103031
• Einige ungelöste Probleme der klassischen Analysis
• Klassifikation der verallgemeinerten Regelflächen durch ihre Kommerellhyperflächen
• Klassenkörpertheoretische Deutung der Struktur der Klassengruppe des zyklischen Zahlkörpers
• scientific article; zbMATH DE number 3306124
• scientific article; zbMATH DE number 3510855

Cited in

(4)

• Coxeter groups and nonuniform complexity
• Topological invariants of classification problems
• Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree
• Polynomial size \(\Omega\)-branching programs and their computational power

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 Q3686041)