Leslie Valiant
Leslie Valiant
Невідома організація
Немає підтвердженої електронної адреси
НазваПосиланняРік
A theory of the learnable
LG Valiant
Proceedings of the sixteenth annual ACM symposium on Theory of computing …, 1984
61011984
A bridging model for parallel computation
LG Valiant
Communications of the ACM 33 (8), 103-111, 1990
42791990
The complexity of computing the permanent
LG Valiant
Theoretical computer science 8 (2), 189-201, 1979
25871979
The complexity of enumeration and reliability problems
LG Valiant
SIAM Journal on Computing 8 (3), 410-421, 1979
19461979
Cryptographic limitations on learning Boolean formulae and finite automata
M Kearns, L Valiant
Journal of the ACM (JACM) 41 (1), 67-95, 1994
9931994
Fast probabilistic algorithms for Hamiltonian circuits and matchings
D Angluin, LG Valiant
Journal of Computer and system Sciences 18 (2), 155-193, 1979
8151979
Random generation of combinatorial structures from a uniform distribution
MR Jerrum, LG Valiant, VV Vazirani
Theoretical Computer Science 43, 169-188, 1986
8111986
Universal schemes for parallel communication
LG Valiant, GJ Brebner
Proceedings of the thirteenth annual ACM symposium on Theory of computing …, 1981
8041981
NP is as easy as detecting unique solutions
LG Valiant, VV Vazirani
Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985
7471985
A scheme for fast parallel communication
LG Valiant
SIAM journal on computing 11 (2), 350-361, 1982
7101982
Computational limitations on learning from examples
L Pitt, LG Valiant
Journal of the ACM (JACM) 35 (4), 965-984, 1988
6071988
A general lower bound on the number of examples needed for learning
A Ehrenfeucht, D Haussler, M Kearns, L Valiant
Information and Computation 82 (3), 247-261, 1989
5271989
General purpose parallel architectures
LG Valiant
Algorithms and Complexity, 943-971, 1990
5221990
Parallelism in comparison problems
LG Valiant
SIAM Journal on Computing 4 (3), 348-355, 1975
4801975
Completeness classes in algebra
LG Valiant
Proceedings of the eleventh annual ACM symposium on Theory of computing, 249-261, 1979
4661979
Universality considerations in VLSI circuits
LG Valiant
IEEE Transactions on Computers 100 (2), 135-140, 1981
4321981
Learning Disjunction of Conjunctions.
LG Valiant
IJCAI, 560-566, 1985
3971985
On the learnability of Boolean formulae
M Kearns, M Li, L Pitt, L Valiant
Annual ACM Symposium on Theory of Computing: Proceedings of the nineteenth …, 1987
3711987
General context-free recognition in less than cubic time
LG Valiant
Journal of computer and system sciences 10 (2), 308-315, 1975
3561975
A fast parallel algorithm for routing in permutation networks
GF Lev, N Pippenger, LG Valiant
IEEE transactions on Computers 100 (2), 93-100, 1981
3361981
У даний момент система не може виконати операцію. Спробуйте пізніше.
Статті 1–20