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

Бүрэн текст авах