scientific article; zbMATH DE number 176518

MaRDI QIDQ4035684zbMATH OpenFDO

Authors Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel

Publication date 18 May 1993

zbMATH Keywords

logspace counting classeslogspace-MOD-classes

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Structure and importance of logspace-MOD class
• Counting classes: Thresholds, parity, mods, and fewness
• On the complexity of solving linear congruences and computing nullspaces modulo a constant
• A very hard log-space counting class
• The complexity of matrix rank and feasible systems of linear equations

Cited in

(8)

• Comparing counting classes for logspace, one-way logspace, and first-order
• Rank logic is dead, long live rank logic!
• On the complexity of solving linear congruences and computing nullspaces modulo a constant
• A very hard log-space counting class
• Complexity and polymorphisms for digraph constraint problems under some basic constructions
• Structure and importance of logspace-MOD class
• scientific article; zbMATH DE number 827986 (Why is no real title available?)
• A note on logspace optimization

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