• Publications
  • Influence

Claim Your Author Page
Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage your publications. Semantic Scholar automatically creates author pages based on data aggregated from public sources and our publisher partners.
  • Christian Glaßer, Heinz Schmitz
  • Mathematics, Computer Science
  • STACS
  • 2000 (First Publication: 1 February 2000)
  • We prove an effective characterization of languages having dot-depth 3/2. Let B3/2 denote this class, i.e., languages that can be written as finite unions of languages of the form u0L1u1L2u2 ...Expand
  • C. Glaßer, A. Selman, S. Sengupta, Liyu Zhang
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 2004 (First Publication: 1 June 2004)
  • We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof systems exist, and weExpand
  • C. Glaßer, A. Selman, S. Sengupta
  • Mathematics, Computer Science
  • Proceedings. 19th IEEE Annual Conference on…
  • 2004 (First Publication: 1 August 2005)
  • Razborov (1994) proved that existence of an optimal proof system implies existence of a many-one complete disjoint NP-pair. Kobler, Messner, and Toran (2003) defined a stronger form of many-oneExpand
  • Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr
  • Mathematics, Computer Science
  • Theory of Computing Systems
  • 2008 (First Publication: 18 December 2009)
  • We investigate the complexity of equivalence problems for {∪,∩,−,+,×}-circuits computing sets of natural numbers. These problems were first introduced by Stockmeyer and Meyer (1973). We continue thisExpand