Travelled to:1 × Australia
1 × Denmark
1 × Germany
1 × Greece
1 × Portugal
1 × Switzerland
1 × United Kingdom
12 × USA
Collaborated with:∅ M.J.Kearns L.Michael V.V.Vazirani J.H.Reif G.J.Brebner D.Angluin H.Guo P.Lu M.Li L.Pitt
Talks about:circuit (4) boolean (3) comput (3) exponenti (2) learnabl (2) automata (2) univers (2) problem (2) formula (2) equival (2)
Person: Leslie G. Valiant
DBLP: Valiant:Leslie_G=
Contributed to:
2011
20082005
2001199919981989198719871985198419831981197919771976197619751974Wrote 21 papers:
- ICALP-v1-2011-GuoLV #complexity #problem #symmetry
- The Complexity of Symmetric Boolean Parity Holant Problems — (HG, PL, LGV), pp. 712–723.
- KR-2008-MichaelV
- A First Experimental Demonstration of Massive Knowledge Infusion (LM, LGV), pp. 378–389.
- ICALP-2005-Valiant #artificial reality
- Holographic Circuits (LGV), pp. 1–15.
- STOC-2001-Valiant #polynomial #quantum
- Quantum computers that can be simulated classically in polynomial time (LGV), pp. 114–123.
- STOC-1999-Valiant #logic #robust
- Robust Logics (LGV), pp. 642–651.
- ICALP-1998-Valiant #architecture
- A Neuroidal Architecture for Cognitive Computation (LGV), pp. 642–669.
- STOC-1989-KearnsV #automaton #encryption #finite #learning
- Cryptographic Limitations on Learning Boolean Formulae and Finite Automata (MJK, LGV), pp. 433–444.
- ICALP-1987-Valiant #formal method #learning
- Recent Developments in the Theory of Learning (LGV), p. 563.
- STOC-1987-KearnsLPV #on the
- On the Learnability of Boolean Formulae (MJK, ML, LP, LGV), pp. 285–295.
- STOC-1985-ValiantV #detection
- NP Is as Easy as Detecting Unique Solutions (LGV, VVV), pp. 458–463.
- STOC-1984-Valiant #formal method
- A Theory of the Learnable (LGV), pp. 436–445.
- STOC-1983-ReifV #linear #network
- A Logarithmic Time Sort for Linear Size Networks (JHR, LGV), pp. 10–16.
- STOC-1983-Valiant #bound #exponential #strict
- Exponential Lower Bounds for Restricted Monotone Circuits (LGV), pp. 110–117.
- STOC-1981-ValiantB #communication #parallel
- Universal Schemes for Parallel Communication (LGV, GJB), pp. 263–277.
- STOC-1979-Valiant
- Negation Can Be Exponentially Powerful (LGV), pp. 189–196.
- STOC-1979-Valiant79a #algebra
- Completeness Classes in Algebra (LGV), pp. 249–261.
- STOC-1977-AngluinV #algorithm #performance #probability
- Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings (DA, LGV), pp. 30–41.
- ICALP-1976-Valiant #decidability #equivalence #problem
- The Equivalence Problem for DOL Systems and its Decidability for Binary Alphabets (LGV), pp. 31–37.
- STOC-1976-Valiant
- Universal Circuits (LGV), pp. 196–203.
- STOC-1975-Valiant #bound #complexity #on the
- On Non-linear Lower Bounds in Computational Complexity (LGV), pp. 45–53.
- STOC-1974-Valiant #automaton #decidability #equivalence
- The Decidability of Equivalence for Deterministic Finite-Turn Pushdown Automata (LGV), pp. 27–32.