Complexity Lower Bounds from Algorithm Design av Williams, R Ryan

Hämta fulltext

Computable PAC Learning of Continuous Features av Ackerman, Nathanael, Asilis, Julian, Di, Jieqi, Freer, Cameron, Tristan, Jean-Baptiste

Hämta fulltext

De-linearizing linearity : projective quantum axiomatics from strong compact closure av Coecke, B

“…Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LiCS'04), IEEE Computer Science Press. …”

Backprop as Functor: A compositional perspective on supervised learning av Fong, Brendan C, Spivak, David I, Tuyeras, Remy V

Hämta fulltext

Computable decision making on the reals and other spaces via partiality and nondeterminism av Sherman, Benjamin, Sciarappa, Luke, Chlipala, Adam, Carbin, Michael James

Hämta fulltext

Event domains, stable functions and proof-nets av Abramsky, S

“…<em>Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science</em>, 431–44, 1999].</p>…”

Solvability of matrix-exponential equations av Ouaknine, J, Pouly, A, Sousa Pinto, J, Worrell, J

On the succinctness of query rewriting over shallow ontologies av Kikot, Stanislav, Kontchakov, Roman, Podolskii, Vladimir, Zakharyaschev, Michael

Hämta fulltext

Strongly compact closed semantics av Coecke, B

“…In: <em>Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science</em> (LiCS'04), IEEE Computer Science Press. …”

Tree-like queries in OWL 2 QL: succinctness and complexity results av Bienvenu, Meghyn, Kikot, Stanislav, Podolskii, Vladimir

Hämta fulltext

An improved lower bound for the complementation of Rabin automata av Cai, Yang, Zhang, Ting, Luo, Haifeng

Hämta fulltext