Остановите войну!
for scientists:
default search action
Leslie G. Valiant
- > Home > Persons > Leslie G. Valiant
Publications
- 2013
- [j50]Heng Guo, Pinyan Lu, Leslie G. Valiant:
The Complexity of Symmetric Boolean Parity Holant Problems. SIAM J. Comput. 42(1): 324-356 (2013) - 2012
- [c57]Christos H. Papadimitriou, Leonard M. Adleman, Richard M. Karp, Donald E. Knuth, Robert E. Tarjan, Leslie G. Valiant:
An Algorithmic View of the Universe. ACM-TURING 2012: 13:1 - 2011
- [c56]Heng Guo, Pinyan Lu, Leslie G. Valiant:
The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract). ICALP (1) 2011: 712-723 - 2010
- [c55]Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan:
Evolution with Drifting Targets. COLT 2010: 155-167 - [i4]Varun Kanade, Leslie G. Valiant, Jennifer Wortman Vaughan:
Evolution with Drifting Targets. CoRR abs/1005.3566 (2010) - 2009
- [j46]Vitaly Feldman, Leslie G. Valiant:
Experience-Induced Neural Circuits That Achieve High Capacity. Neural Comput. 21(10): 2715-2754 (2009) - 2008
- [c52]Vitaly Feldman, Leslie G. Valiant:
The Learning Power of Evolution. COLT 2008: 513-514 - 1999
- [c41]Roni Khardon, Dan Roth, Leslie G. Valiant:
Relational Learning for NLP using Linear Threshold Elements. IJCAI 1999: 911-919 - 1994
- [j36]Michael J. Kearns, Leslie G. Valiant:
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. J. ACM 41(1): 67-95 (1994) - [j35]Michael J. Kearns, Ming Li, Leslie G. Valiant:
Learning Boolean Formulas. J. ACM 41(6): 1298-1328 (1994) - 1993
- [c30]Michael J. Kearns, Leslie G. Valiant:
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. Machine Learning: From Theory to Applications 1993: 29-49 - 1991
- [e1]Manfred K. Warmuth, Leslie G. Valiant:
Proceedings of the Fourth Annual Workshop on Computational Learning Theory, COLT 1991, Santa Cruz, California, USA, August 5-7, 1991. Morgan Kaufmann 1991, ISBN 1-55860-213-5 [contents] - 1989
- [j32]Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant:
A General Lower Bound on the Number of Examples Needed for Learning. Inf. Comput. 82(3): 247-261 (1989) - [c27]Michael J. Kearns, Leslie G. Valiant:
Cryptographic Limitations on Learning Boolean Formulae and Finite Automata. STOC 1989: 433-444 - 1988
- [j31]Leonard Pitt, Leslie G. Valiant:
Computational limitations on learning from examples. J. ACM 35(4): 965-984 (1988) - [c24]Andrzej Ehrenfeucht, David Haussler, Michael J. Kearns, Leslie G. Valiant:
A General Lower Bound on the Number of Examples Needed for Learning. COLT 1988: 139-154 - 1987
- [j30]John H. Reif, Leslie G. Valiant:
A logarithmic time sort for linear size networks. J. ACM 34(1): 60-76 (1987) - [c22]Michael J. Kearns, Ming Li, Leonard Pitt, Leslie G. Valiant:
On the Learnability of Boolean Formulae. STOC 1987: 285-295 - 1986
- [j28]Mark Jerrum, Leslie G. Valiant, Vijay V. Vazirani:
Random Generation of Combinatorial Structures from a Uniform Distribution. Theor. Comput. Sci. 43: 169-188 (1986) - [j27]Leslie G. Valiant, Vijay V. Vazirani:
NP is as Easy as Detecting Unique Solutions. Theor. Comput. Sci. 47(3): 85-93 (1986) - 1985
- [j26]Sven Skyum, Leslie G. Valiant:
A Complexity Theory Based on Boolean Algebra. J. ACM 32(2): 484-502 (1985) - [c19]Leslie G. Valiant, Vijay V. Vazirani:
NP Is as Easy as Detecting Unique Solutions. STOC 1985: 458-463 - 1983
- [j23]Leslie G. Valiant, Sven Skyum, S. Berkowitz, Charles Rackoff:
Fast Parallel Computation of Polynomials Using Few Processors. SIAM J. Comput. 12(4): 641-644 (1983) - [c17]John H. Reif, Leslie G. Valiant:
A Logarithmic Time Sort for Linear Size Networks. STOC 1983: 10-16 - 1981
- [j18]Gavriela Freund Lev, Nicholas Pippenger, Leslie G. Valiant:
A Fast Parallel Algorithm for Routing in Permutation Networks. IEEE Trans. Computers 30(2): 93-100 (1981) - [c15]Sven Skyum, Leslie G. Valiant:
A Complexity Theory Based on Boolean Algebra. FOCS 1981: 244-253 - [c14]Leslie G. Valiant, Sven Skyum:
Fast Parallel Computation of Polynomials Using Few Processes. MFCS 1981: 132-139 - 1979
- [j14]Dana Angluin, Leslie G. Valiant:
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. J. Comput. Syst. Sci. 18(2): 155-193 (1979) - 1977
- [j11]John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant:
On Time Versus Space. J. ACM 24(2): 332-337 (1977) - [c7]Dana Angluin, Leslie G. Valiant:
Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings. STOC 1977: 30-41 - 1976
- [j8]Nicholas Pippenger, Leslie G. Valiant:
Shifting Graphs and Their Applications. J. ACM 23(3): 423-432 (1976) - [j6]Mike Paterson, Leslie G. Valiant:
Circuit Size is Nonlinear in Depth. Theor. Comput. Sci. 2(3): 397-400 (1976) - 1975
- [j3]Leslie G. Valiant, Mike Paterson:
Deterministic One-Counter Automata. J. Comput. Syst. Sci. 10(3): 340-350 (1975) - [c4]John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant:
On Time versus Space and Related Problems. FOCS 1975: 57-64 - 1973
- [c1]Leslie G. Valiant, Mike Paterson:
Deterministic one-counter automata. Automatentheorie und Formale Sprachen 1973: 104-115
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-10-01 22:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint