Thomas Hofmeister

Available identifiers

zbMath Open hofmeister.thomasMaRDI QIDQ675060

List of research outcomes

Publication	Date of Publication	Type
A note on the simulation of exponential threshold weights	2024-01-29	Paper
Semidefinite programming and its applications to approximation algorithms	2018-07-03	Paper
A combinatorial design approach to MAXCUT	2017-11-16	Paper
Derandomization for sparse approximations and independent sets	2010-06-17	Paper
Multiple product modulo arbitrary numbers	2010-06-17	Paper
Algorithms - ESA 2003	2010-03-03	Paper
Constrained Minkowski sums: A geometric framework for solving interval problems in computational biology efficiently	2009-07-06	Paper
https://portal.mardi4nfdi.de/entity/Q3602889	2009-02-12	Paper
An Algorithm for a Generalized Maximum Subsequence Problem	2008-09-18	Paper
Randomized algorithms for 3-SAT	2007-03-12	Paper
https://portal.mardi4nfdi.de/entity/Q4736839	2004-08-11	Paper
On \(k\)-partite subgraphs	2001-06-10	Paper
https://portal.mardi4nfdi.de/entity/Q4941919	2000-11-20	Paper
An Algorithm for Heilbronn's Problem	2000-10-18	Paper
Depth efficient neural networks for division and related problems	2000-08-14	Paper
Sparse 0−1 Matrices and Forbidden Hypergraphs	2000-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q4266538	1999-10-03	Paper
https://portal.mardi4nfdi.de/entity/Q4250179	1999-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4218130	1998-11-11	Paper
https://portal.mardi4nfdi.de/entity/Q4364587	1998-03-10	Paper
Multiple product modulo arbitrary numbers	1997-11-12	Paper
A combinatorial design approach to MAXCUT	1997-05-20	Paper
Independent sets in graphs with triangles	1997-02-27	Paper
Computing sparse approximations deterministically	1996-12-05	Paper
https://portal.mardi4nfdi.de/entity/Q4839052	1996-04-10	Paper
Some notes on threshold circuits, and multiplication in depth 4	1992-06-27	Paper

Research outcomes over time

This page was built for person: Thomas Hofmeister