Person:675224

Available identifiers

zbMath Open damm.carstenMaRDI QIDQ675224

List of research outcomes

Publication	Date of Publication	Type
Separating counting communication complexity classes	2022-08-18	Paper
Parallel complexity of iterated morphisms and the arithmetic of small numbers	2022-08-18	Paper
Inductive counting below logspace	2022-08-18	Paper
Some bounds on multiparty communication complexity of pointer jumping	2017-11-16	Paper
Automata that take advice	2010-06-17	Paper
On approximation by \(^{\oplus}\)-OBDDs	2010-01-29	Paper
https://portal.mardi4nfdi.de/entity/Q3527016	2008-09-25	Paper
Complexity of some arithmetic problems for binary polynomials	2004-12-13	Paper
On relations between counting communication complexity classes	2004-10-01	Paper
The complexity of tensor calculus	2003-11-17	Paper
The average sensitivity of square-freeness	2003-06-09	Paper
Circuit and decision tree complexity of some number theoretic problems	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q4938660	2000-07-05	Paper
On the Average Sensitivity of Testing Square-Free Numbers	2000-04-03	Paper
Some bounds on multiparty communication complexity of pointer jumping	1999-05-18	Paper
Depth-efficient simulation of Boolean semi-unbounded circuits by arithmetic ones	1999-04-28	Paper
https://portal.mardi4nfdi.de/entity/Q4399253	1998-07-28	Paper
Expressing uniformity via oracles	1997-07-28	Paper
Inductive counting for width-restricted branching programs	1997-03-06	Paper
https://portal.mardi4nfdi.de/entity/Q4858953	1996-05-27	Paper
https://portal.mardi4nfdi.de/entity/Q4035684	1993-05-18	Paper
Separating complexity classes related to \(\Omega\)-decision trees	1993-04-22	Paper
Structure and importance of logspace-MOD class	1992-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q3974860	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3976033	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3979264	1992-06-26	Paper
Problems complete for \(\oplus L\)	1990-01-01	Paper

Research outcomes over time

This page was built for person: Carsten Damm