Search
w/in this Title
for Titles
All Reviews
ACM Transactions on Computation Theory
A C M (ASSN FOR COMPUTING MAC)
Options:
Date Reviewed
Title
Author
Publisher
Published Date
Descending Order
Ascending Order
17 of 7 reviews
Date Reviewed
A complexity trichotomy for approximately counting list
H
colorings
Galanis A., Goldberg L., Jerrum M. ACM Transactions on Computation Theory 9(2): 122, 2017. Type: Article
H
colorings are essential in the exploration of language syntax expositions. An
H
coloring is the allocation of adjacent colors to neighboring vertices of a graph
G
. An
H
...
Jan 11 2018
Quadratic maps are hard to sample
Viola E. ACM Transactions on Computation Theory 8(4): 14, 2016. Type: Article
A quadratic map is a function of the form
f
(
x
) =
ax
^{2}
+
bx
+
c
, or more generally,...
Jul 26 2016
(Leveled) fully homomorphic encryption without bootstrapping
Brakerski Z., Gentry C., Vaikuntanathan V. ACM Transactions on Computation Theory 6(3): Article No. 13, 2014. Type: Article
If you work with large amounts of data being hosted on public clouds, homomorphic encryption (HE) is an extremely innovative idea to add security layers to your data while it is being hosted and processed on thirdparty servers. Basically, HE allo...
Jul 24 2015
Compressed matrix multiplication
Pagh R. ACM Transactions on Computation Theory 5(3): 117, 2013. Type: Article, Reviews: (2 of 2)
This paper is concerned with approximating a matrix product, that is, finding the large entries (
AB
)
_{{i,j}}
[and the corresponding indices (
i
,
j
...
Jul 18 2014
Compressed matrix multiplication
Pagh R. ACM Transactions on Computation Theory 5(3): 117, 2013. Type: Article, Reviews: (1 of 2)
There has been a lot of research on matrix multiplication algorithms in the recent past. For insight, one should read the second volume of Knuth’s wonderful set of books on algorithms [1]....
Jun 5 2014
Exact learning algorithms, betting games, and circuit lower bounds
Harkins R., Hitchcock J. ACM Transactions on Computation Theory 5(4): 111, 2013. Type: Article
It is natural to expect that the more complex a concept is, the harder it is to learn. This paper improves this type of correlation for concepts that are represented by a class of circuits
. It shows t...
Feb 19 2014
Formula caching in DPLL
Beame P., Impagliazzo R., Pitassi T., Segerlind N. ACM Transactions on Computation Theory 1(3): 133, 2010. Type: Article
The DPLL algorithm is a satisfiabilitybased algorithm. The authors consider in this paper the extension of the DPLL approach to satisfiability checking, by adding memoization, which means saving previously solved subproblems for later use (also c...
Nov 30 2010
Display
5
10
15
25
50
100
per column
Reproduction in whole or in part without permission is prohibited. Copyright © 20002022 ThinkLoud, Inc.
Terms of Use

Privacy Policy