The following pages link to Christoph Meinel (Q202501):
Displaying 50 items.
- Logic vs. complexity theoretic properties of the graph accessibility problem for directed graphs of bounded degree (Q910223) (← links)
- Polynomial size \(\Omega\)-branching programs and their computational power (Q918199) (← links)
- Bounded width problems and algebras (Q997127) (← links)
- The power of nondeterminism in polynomial-size bounded-width branching programs (Q1116338) (← links)
- Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits (Q1121671) (← links)
- Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\) (Q1178711) (← links)
- Über einen Satz von Köhler. (A theorem of Köhler) (Q1183977) (← links)
- Modified branching programs and their computational power (Q1187665) (← links)
- Separating complexity classes related to \(\Omega\)-decision trees (Q1202936) (← links)
- On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs (Q1330665) (← links)
- (Q1364131) (redirect page) (← links)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q1364133) (← links)
- Ordered binary design graphs and their signification in computer aided design of high-integrated circuits (Q1374798) (← links)
- Semantic integration of heterogeneous software specifications. (Q1428350) (← links)
- Rough sets. Mathematical foundations (Q1872778) (← links)
- On relations between counting communication complexity classes (Q1880784) (← links)
- Comprehensive mathematics for computer scientists. 1: Sets and numbers, graphs and algebra, logic and machines, linear geometry (Q1888946) (← links)
- Combinatorial problems raised from 2-semilattices (Q2496183) (← links)
- (Q2995546) (← links)
- (Q3043126) (← links)
- Remodeling Vulnerability Information (Q3056908) (← links)
- (Q3313261) (← links)
- (Q3318115) (← links)
- (Q3318116) (← links)
- (Q3334080) (← links)
- (Q3357532) (← links)
- Mathematische Grundlagen der Informatik (Q3447492) (← links)
- (Q3476311) (← links)
- Lower bounds for the majority communication complexity of various graph accessibility problems (Q3569020) (← links)
- An Operator for Removal of Subsumed Clauses (Q3628566) (← links)
- (Q3667951) (← links)
- (Q3691062) (← links)
- (Q3714464) (← links)
- (Q3751569) (← links)
- (Q3761701) (← links)
- (Q3771596) (← links)
- (Q3779737) (← links)
- (Q3783568) (← links)
- (Q3787493) (← links)
- (Q3790655) (← links)
- (Q3804193) (← links)
- (Q3870317) (← links)
- (Q3942404) (← links)
- (Q3953178) (← links)
- (Q3960124) (← links)
- (Q3974860) (← links)
- (Q3975159) (← links)
- (Q3976028) (← links)
- (Q3991212) (← links)
- (Q3994391) (← links)
