Complexity Lower Bounds from Algorithm Design Por Williams, R Ryan

Obter o texto integral

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

Obter o texto integral

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

Obter o texto integral

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

Obter o texto integral

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

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

Obter o texto integral

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

Obter o texto integral

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

Obter o texto integral