The following pages link to Christoph Meinel (Q202501):
Displaying 3 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)
- A reducibility concept for problems defined in terms of ordered binary decision diagrams (Q5047173) (← links)
