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

Ստացեք ամբողջական տեքստը