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

獲取全文