The following pages link to Leslie G. Valiant (Q1079378):
Displaying 50 items.
- The complexity of computing the permanent (Q600247) (← links)
- A bridging model for multi-core computing (Q619912) (← links)
- Random generation of combinatorial structures from a uniform distribution (Q1079379) (← links)
- NP is as easy as detecting unique solutions (Q1090454) (← links)
- Fast probabilistic algorithms for Hamiltonian circuits and matchings (Q1141153) (← links)
- Negation can be exponentially powerful (Q1143790) (← links)
- Computing multivariate polynomials in parallel (Q1166928) (← links)
- Reducibility by algebraic projections (Q1168734) (← links)
- Size bounds for superconcentrators (Q1170885) (← links)
- Deterministic one-counter automata (Q1218272) (← links)
- General context-free recognition in less than cubic time (Q1219690) (← links)
- Relative complexity of checking and evaluating (Q1232181) (← links)
- Circuit size is nonlinear in depth (Q1233426) (← links)
- Graph-theoretic properties in computational complexity (Q1236886) (← links)
- Some observations on holographic algorithms (Q1616615) (← links)
- (Q1823010) (redirect page) (← links)
- A general lower bound on the number of examples needed for learning (Q1823011) (← links)
- Expressiveness of matchgates. (Q1853537) (← links)
- Corrigendum to ``Expressiveness of matchgates'' (Q1874425) (← links)
- Projection learning (Q1964679) (← links)
- A quantitative theory of neural computation (Q2373125) (← links)
- The Hippocampus as a Stable Memory Allocator for Cortex (Q2840872) (← links)
- A neuroidal architecture for cognitive computation (Q2946995) (← links)
- Quantum Circuits That Can Be Simulated Classically in Polynomial Time (Q3149866) (← links)
- (Q3165977) (← links)
- Short monotone formulae for the majority function (Q3218066) (← links)
- Deductive learning (Q3334096) (← links)
- (Q3343438) (← links)
- Experience-Induced Neural Circuits That Achieve High Capacity (Q3399355) (← links)
- Holographic Algorithms (Q3532577) (← links)
- A Bridging Model for Multi-core Computing (Q3541070) (← links)
- Some Observations on Holographic Algorithms (Q3557051) (← links)
- (Q3662623) (← links)
- Optimality of a Two-Phase Strategy for Routing in Interconnection Networks (Q3682403) (← links)
- (Q3707409) (← links)
- A theory of the learnable (Q3714486) (← links)
- (Q3777952) (← links)
- Optimally universal parallel computers (Q3802617) (← links)
- Computational limitations on learning from examples (Q3813320) (← links)
- The Complexity of Enumeration and Reliability Problems (Q3853129) (← links)
- (Q3861406) (← links)
- Universality considerations in VLSI circuits (Q3904539) (← links)
- A fast parallel algorithm for routing in permutation networks (Q3904540) (← links)
- (Q3929052) (← links)
- A Scheme for Fast Parallel Communication (Q3936664) (← links)
- (Q4036702) (← links)
- Regularity and Related Problems for Deterministic Pushdown Automata (Q4045649) (← links)
- Parallelism in Comparison Problems (Q4069777) (← links)
- Shifting Graphs and Their Applications (Q4102736) (← links)
- A note on the succinctness of descriptions of deterministic languages (Q4105806) (← links)
