scientific article; zbMATH DE number 176518
From MaRDI portal
Publication:4035684
zbMATH Open0764.68041MaRDI QIDQ4035684FDOQ4035684
Authors: Gerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel 
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
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)
- Title not available (Why is that?)
- On the complexity of solving linear congruences and computing nullspaces modulo a constant
- A very hard log-space counting class
- Structure and importance of logspace-MOD class
- Rank logic is dead, long live rank logic!
- A note on logspace optimization
- Comparing counting classes for logspace, one-way logspace, and first-order
- Complexity and polymorphisms for digraph constraint problems under some basic constructions
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)
