Complexity Lower Bounds from Algorithm Design por Williams, R Ryan

Ligazón do recurso

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

Ligazón do recurso

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

Ligazón do recurso

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

Ligazón do recurso

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

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

Ligazón do recurso

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

Ligazón do recurso

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

Ligazón do recurso