Frank Stephan

1. Anti-complex sets and reducibilities with tiny use
   2011/10/03 by Johanna N. Y. Franklin, Noam Greenberg, Franklin, Johanna N. Y. +5 · 2 citations
   Computer Science · Mathematics · #Benford’s Law and Fraud Detection #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #math.LO #semigroups and automata theory
2. Finite state incompressible infinite sequences
   2015/12/01 by Cristian S. Calude, Ludwig Staiger, Frank Stephan · 2 citations
   Computer Science · #Algorithms and Data Compression #Computability, Logic, AI Algorithms #semigroups and automata theory
3. Deciding Parity Games in Quasi-polynomial Time
   2020/01/14 by Cristian S. Calude, Sanjay Jain, Bakhadyr Khoussainov +2 · 1 citation
   Computer Science · #Advanced Graph Theory Research #Formal Methods in Verification #Polynomial and algebraic computation