Christian Glaßer

Available identifiers

zbMath Open glasser.christianMaRDI QIDQ306279

List of research outcomes

Publication	Date of Publication	Type
https://portal.mardi4nfdi.de/entity/Q5874280	2023-02-07	Paper
https://portal.mardi4nfdi.de/entity/Q5111247	2020-05-26	Paper
Emptiness problems for integer circuits	2020-05-23	Paper
Circuit satisfiability and constraint satisfaction around Skolem arithmetic	2017-11-07	Paper
Autoreducibility and mitoticity of logspace-complete sets for NP and other classes	2017-09-28	Paper
Introduction to Autoreducibility and Mitoticity	2017-04-04	Paper
Efficient algorithms for membership in Boolean hierarchies of regular languages	2016-08-31	Paper
Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic	2016-08-17	Paper
Unions of Disjoint NP-Complete Sets	2015-09-07	Paper
Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes	2014-10-14	Paper
Perfect correspondences between dot-depth and polynomial-time hierarchies	2014-06-10	Paper
Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions	2013-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4910731	2013-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q2911611	2012-08-31	Paper
Structural Complexity of Multiobjective NP Search Problems	2012-06-29	Paper
Unions of Disjoint NP-Complete Sets	2011-08-17	Paper
The fault tolerance of NP-hard problems	2011-07-27	Paper
The shrinking property for NP and coNP	2011-02-21	Paper
Space-efficient informational redundancy	2010-10-07	Paper
Satisfiability of algebraic circuits over sets of natural numbers	2010-08-13	Paper
Approximability and Hardness in Multi-objective Optimization	2010-07-29	Paper
Equivalence problems for circuits over sets of natural numbers	2010-03-05	Paper
Machines that can output empty words	2009-08-06	Paper
THE INFORMATIONAL CONTENT OF CANONICAL DISJOINT NP-PAIRS	2009-06-30	Paper
Non-mitotic sets	2009-05-28	Paper
The Fault Tolerance of NP-Hard Problems	2009-04-02	Paper
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy	2009-03-26	Paper
The Informational Content of Canonical Disjoint NP-Pairs	2009-03-06	Paper
Multiobjective Disk Cover Admits a PTAS	2009-01-29	Paper
Space-Efficient Informational Redundancy	2009-01-29	Paper
The complexity of unions of disjoint sets	2008-11-19	Paper
Splitting NP-Complete Sets	2008-10-28	Paper
The Shrinking Property for NP and coNP	2008-06-19	Paper
Equivalence Problems for Circuits over Sets of Natural Numbers	2008-06-03	Paper
Non-mitotic Sets	2008-04-24	Paper
Satisfiability of Algebraic Circuits over Sets of Natural Numbers	2008-04-24	Paper
Languages of dot-depth 3/2	2008-04-03	Paper
Redundancy in Complete Sets	2008-03-19	Paper
Mathematical Foundations of Computer Science 2003	2007-12-07	Paper
Machines that Can Output Empty Words	2007-09-05	Paper
The Complexity of Unions of Disjoint Sets	2007-09-03	Paper
Autoreducibility, mitoticity, and immunity	2007-05-30	Paper
Properties of NP‐Complete Sets	2007-05-03	Paper
Theory and Applications of Models of Computation	2007-04-30	Paper
Canonical disjoint NP-pairs of propositional proof systems	2007-02-26	Paper
Languages polylog-time reducible to dot-depth 1/2	2007-01-22	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper
Error-bounded probabilistic computations between MA and AM	2006-10-05	Paper
Generation problems	2005-12-06	Paper
STACS 2005	2005-12-02	Paper
Reductions between disjoint NP-pairs	2005-09-02	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
Mathematical Foundations of Computer Science 2004	2005-08-22	Paper
The complexity of base station positioning in cellular networks	2005-05-04	Paper
Disjoint NP-Pairs	2005-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q4737912	2004-08-11	Paper
https://portal.mardi4nfdi.de/entity/Q4472471	2004-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q4531372	2002-08-05	Paper
https://portal.mardi4nfdi.de/entity/Q4501562	2000-09-04	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Christian Glaßer