Complexity Lower Bounds from Algorithm Design nork Williams, R Ryan

Testu osoa

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

Testu osoa

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

Testu osoa

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

Testu osoa

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

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

Testu osoa

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

Testu osoa

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

Testu osoa