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

קבל טקסט מלא