Complexity Lower Bounds from Algorithm Design di Williams, R Ryan

Testo

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

Testo

De-linearizing linearity : projective quantum axiomatics from strong compact closure di 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 di Fong, Brendan C, Spivak, David I, Tuyeras, Remy V

Testo

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

Testo

Event domains, stable functions and proof-nets di 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 di Ouaknine, J, Pouly, A, Sousa Pinto, J, Worrell, J

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

Testo

Strongly compact closed semantics di 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 di Bienvenu, Meghyn, Kikot, Stanislav, Podolskii, Vladimir

Testo

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

Testo