Complexity Lower Bounds from Algorithm Design de réir Williams, R Ryan

Faigh an téacs iomlán

Computable PAC Learning of Continuous Features de réir Ackerman, Nathanael, Asilis, Julian, Di, Jieqi, Freer, Cameron, Tristan, Jean-Baptiste

Faigh an téacs iomlán

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

Faigh an téacs iomlán

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

Faigh an téacs iomlán

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

On the succinctness of query rewriting over shallow ontologies de réir Kikot, Stanislav, Kontchakov, Roman, Podolskii, Vladimir, Zakharyaschev, Michael

Faigh an téacs iomlán

Strongly compact closed semantics de réir 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 de réir Bienvenu, Meghyn, Kikot, Stanislav, Podolskii, Vladimir

Faigh an téacs iomlán

An improved lower bound for the complementation of Rabin automata de réir Cai, Yang, Zhang, Ting, Luo, Haifeng

Faigh an téacs iomlán