The following pages link to Fabian Wagner (Q500987):
Displayed 19 items.
- Beating the generator-enumeration bound for \(p\)-group isomorphism (Q500988) (← links)
- Counting the number of perfect matchings in \(K_{5}\)-free graphs (Q503455) (← links)
- Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) (← links)
- The isomorphism problem for planar 3-connected graphs is in unambiguous logspace (Q1959391) (← links)
- The minimal length is physical (Q2089971) (← links)
- Graph Isomorphism is not AC 0 reducible to Group Isomorphism (Q2908861) (← links)
- Graph Isomorphism for K_{3, 3}-free and K_5-free graphs is in Log-space. (Q2920122) (← links)
- Graph Isomorphism is Not AC0-Reducible to Group Isomorphism (Q2947584) (← links)
- Graphs of Bounded Treewidth Can Be Canonized in $\mbox{{\sf AC}$^1$}$ (Q3007628) (← links)
- Restricted Space Algorithms for Isomorphism on Bounded Treewidth Graphs (Q3113751) (← links)
- Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space (Q3183622) (← links)
- (Q3191145) (← links)
- Multilevel Sequential Importance Sampling for Rare Event Estimation (Q3303985) (← links)
- Hardness Results for Tournament Isomorphism and Automorphism (Q3525602) (← links)
- (Q3633739) (← links)
- (Q4910756) (← links)
- Error Analysis for Probabilities of Rare Events with Approximate Models (Q5001383) (← links)
- The Ensemble Kalman Filter for Rare Event Estimation (Q5862907) (← links)
- Shift-symmetric Horndeski gravity in the asymptotic-safety paradigm (Q5882756) (← links)