Mikael Goldmann

MaRDI QIDQ204360zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On the power of a threshold gate at the top Information Processing Letters	2016-05-26	Paper
Simulating threshold circuits by majority circuits Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93	2015-05-07	Paper
The complexity of solving equations over finite groups Information and Computation	2003-01-14	Paper
scientific article; zbMATH DE number 1500548 (Why is no real title available?)	2002-09-01	Paper
scientific article; zbMATH DE number 1263233 (Why is no real title available?)	2002-01-30	Paper
Complexity bounds on general hard-core predicates. Journal of Cryptology	2001-11-07	Paper
Monotone Circuits for Connectivity Have Depth (log n)<sup>2-o(1)</sup> SIAM Journal on Computing	1998-09-20	Paper
Simulating Threshold Circuits by Majority Circuits SIAM Journal on Computing	1998-05-10	Paper
scientific article; zbMATH DE number 1088223 (Why is no real title available?)	1998-03-17	Paper
A note on the power of majority gates and modular gates Information Processing Letters	1997-02-28	Paper
scientific article; zbMATH DE number 773999 (Why is no real title available?)	1995-07-13	Paper
On average time hierarchies Information Processing Letters	1994-02-24	Paper
On the power of small-depth threshold circuits Computational Complexity	1993-10-10	Paper
Majority gates vs. general weighted threshold gates Computational Complexity	1993-08-08	Paper
A simple lower bound for monotone clique using a communication game Information Processing Letters	1992-09-26	Paper

Research outcomes over time

This page was built for person: Mikael Goldmann