The following pages link to Christian Glaßer (Q306279):
Displaying 31 items.
- Efficient algorithms for membership in Boolean hierarchies of regular languages (Q306282) (← links)
- The fault tolerance of NP-hard problems (Q553311) (← links)
- The shrinking property for NP and coNP (Q627189) (← links)
- Languages polylog-time reducible to dot-depth 1/2 (Q859980) (← links)
- Canonical disjoint NP-pairs of propositional proof systems (Q868942) (← links)
- Autoreducibility, mitoticity, and immunity (Q881593) (← links)
- The complexity of unions of disjoint sets (Q955349) (← links)
- Satisfiability of algebraic circuits over sets of natural numbers (Q987688) (← links)
- Non-mitotic sets (Q1019177) (← links)
- Circuit satisfiability and constraint satisfaction around Skolem arithmetic (Q1676359) (← links)
- The complexity of base station positioning in cellular networks (Q1775056) (← links)
- Space-efficient informational redundancy (Q1959428) (← links)
- Emptiness problems for integer circuits (Q2182324) (← links)
- Equivalence problems for circuits over sets of natural numbers (Q2268343) (← links)
- Machines that can output empty words (Q2272215) (← links)
- Reductions between disjoint NP-pairs (Q2387199) (← links)
- Autoreducibility and mitoticity of logspace-complete sets for NP and other classes (Q2407092) (← links)
- Perfect correspondences between dot-depth and polynomial-time hierarchies (Q2453555) (← links)
- Languages of dot-depth 3/2 (Q2480745) (← links)
- Error-bounded probabilistic computations between MA and AM (Q2507698) (← links)
- Generation problems (Q2575749) (← links)
- Structural Complexity of Multiobjective NP Search Problems (Q2894478) (← links)
- Applications of Discrepancy Theory in Multiobjective Approximation (Q2911611) (← links)
- Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes (Q2922618) (← links)
- Introduction to Autoreducibility and Mitoticity (Q2973718) (← links)
- Circuit Satisfiability and Constraint Satisfaction Around Skolem Arithmetic (Q3188272) (← links)
- Properties of NP‐Complete Sets (Q3434997) (← links)
- (Q4910731) (← links)
- Emptiness Problems for Integer Circuits (Q5111247) (← links)
- Mathematical Foundations of Computer Science 2003 (Q5431311) (← links)
- NP-Completeness, Proof Systems, and Disjoint NP-Pairs. (Q5874280) (← links)
