Complexity Lower Bounds from Algorithm Design Autor Williams, R Ryan

Získat plný text

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

Získat plný text

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

Získat plný text

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

Získat plný text

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

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

Získat plný text

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

Získat plný text

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

Získat plný text