Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
![]() |
Game Semantics for a Polymorphic Programming LanguageLAIRD, JJournal of the ACM, 2013-08, Vol.60 (4), p.1-27 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
2 |
Material Type: Artigo
|
![]() |
Denotational Semantics with Nominal Scott DomainsLÖSCH, Steffen ; PITTS, Andrew MJournal of the ACM, 2014-07, Vol.61 (4), p.1-46 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
3 |
Material Type: Artigo
|
![]() |
The HOM Problem Is DecidableGODOY, Guillem ; GIMENEZ, OmerJournal of the ACM, 2013-08, Vol.60 (4), p.1-44 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
4 |
Material Type: Artigo
|
![]() |
From Almost Optimal Algorithms to Logics for Complexity Classes via Listings and a Halting ProblemChen, Yijia ; Flum, JörgJournal of the ACM, 2012-08, Vol.59 (4), p.1-34 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
5 |
Material Type: Artigo
|
![]() |
On the Expressiveness and Complexity of Randomization in Finite State MonitorsCHADHA, Rohit ; PRASAD SISTLA, A ; VISWANATHAN, MaheshJournal of the ACM, 2009-08, Vol.56 (5), p.1-44 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
6 |
Material Type: Artigo
|
![]() |
The complexity of probabilistic verificationCOURCOUBETIS, C ; YANNAKAKIS, MJournal of the ACM, 1995-07, Vol.42 (4), p.857-907 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |
7 |
Material Type: Artigo
|
![]() |
Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)Harvey, David ; van der Hoeven, JorisJournal of the ACM, 2022-04, Vol.69 (2), p.1-40, Article 12 [Periódico revisado por pares]New York, NY: ACMTexto completo disponível |
8 |
Material Type: Artigo
|
![]() |
NFA Admits an FPRAS: Efficient Enumeration, Counting, and Uniform Generation for Logspace ClassesArenas, Marcelo ; Croquevielle, Luis Alberto ; Jayaram, Rajesh ; Riveros, CristianJournal of the ACM, 2021-12, Vol.68 (6), p.1-40 [Periódico revisado por pares]New York: Association for Computing MachineryTexto completo disponível |
9 |
Material Type: Artigo
|
![]() |
Polynomial Time Corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial LengthBournez, Olivier ; Graça, Daniel S. ; Pouly, AmauryJournal of the ACM, 2017-12, Vol.64 (6), p.1-76 [Periódico revisado por pares]New York: Association for Computing MachineryTexto completo disponível |
10 |
Material Type: Artigo
|
![]() |
Constructing deterministic finite-state automata in recurrent neural networksOMLIN, C. W ; GILES, C. LJournal of the ACM, 1996-11, Vol.43 (6), p.937-972 [Periódico revisado por pares]New York, NY: Association for Computing MachineryTexto completo disponível |