AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
Daviaud, Guillon, and Merlet proved that comparison of max-plus automata is undecidable under a fixed state bound of 553 and explicitly left the range from 2 to 552 states open. We resolve the two-state endpoint. More strongly, given an arbitrary finite max-plus automaton $A$ and a max-plus automaton $B$ with at most t...
A deterministic exact algorithm is given that counts the linear extensions of an arbitrary $n$-element poset in time $O^*(1.89^n)$ where $O^*(\cdot)$ suppresses polynomial factors.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.