Complexity Lower Bounds from Algorithm Design حسب Williams, R Ryan

احصل على النص الكامل

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

احصل على النص الكامل

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

احصل على النص الكامل

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

احصل على النص الكامل

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

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

احصل على النص الكامل

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

احصل على النص الكامل

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

احصل على النص الكامل