Sciweavers

STOC
1987
ACM
64views Algorithms» more  STOC 1987»
14 years 2 months ago
On Learning Boolean Functions
B. K. Natarajan
STOC
1987
ACM
56views Algorithms» more  STOC 1987»
14 years 2 months ago
Matching Is as Easy as Matrix Inversion
Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazira...
STOC
1987
ACM
45views Algorithms» more  STOC 1987»
14 years 2 months ago
A New Graph Triconnectivity Algorithm and Its Parallelization
Gary L. Miller, Vijaya Ramachandran
STOC
1987
ACM
52views Algorithms» more  STOC 1987»
14 years 2 months ago
On the Learnability of Boolean Formulae
Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G...
STOC
1987
ACM
104views Algorithms» more  STOC 1987»
14 years 2 months ago
The Boolean Formula Value Problem Is in ALOGTIME
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...
Samuel R. Buss
STOC
1987
ACM
46views Algorithms» more  STOC 1987»
14 years 2 months ago
Size-Time Complexity of Boolean Networks for Prefix Computations
Gianfranco Bilardi, Franco P. Preparata
STOC
1987
ACM
82views Algorithms» more  STOC 1987»
14 years 2 months ago
Permutation Groups in NC
We show that the basic problems of permutation group manipulation admit e cient parallel solutions. Given a permutation group G by a list of generators, we nd a set of NC-e cient ...
László Babai, Eugene M. Luks, &Aacut...