Structure and importance of logspace-MOD class

This publication has 19 references indexed in Scilit:

• Using inductive counting to simulate nondeterministic computation
  Published by Springer Nature ,2005
• On the power of parity polynomial time
  Published by Springer Nature ,2005
• A very hard log space counting class
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Counting classes: Thresholds, parity, mods, and fewness
  Published by Springer Nature ,1990
• Two Applications of Inductive Counting for Complementation Problems
  SIAM Journal on Computing, 1989
• Structural Complexity I
  Published by Springer Nature ,1988
• The complexity of sparse sets in P
  Published by Springer Nature ,1986
• A taxonomy of problems with fast parallel algorithms
  Information and Control, 1985
• On computing the determinant in small parallel time using a small number of processors
  Information Processing Letters, 1984
• Fast parallel matrix and GCD computations
  Information and Control, 1982