The following pages link to Richard J. Lipton (Q181990):
Displaying 50 items.
- Time-space lower bounds for satisfiability (Q3455209) (← links)
- Polynomial-time algorithm for the orbit problem (Q3462041) (← links)
- Algorithms for Modular Counting of Roots of Multivariate Polynomials (Q3525790) (← links)
- The P=NP Question and Gödel’s Lost Letter (Q3576993) (← links)
- Improved Simulation of Nondeterministic Turing Machines (Q3586105) (← links)
- On Tractable Exponential Sums (Q3587346) (← links)
- Intrusion-Resilient Key Exchange in the Bounded Retrieval Model (Q3596396) (← links)
- Best-Order Streaming Model (Q3630203) (← links)
- Pseudorandom number generation and space complexity (Q3694692) (← links)
- Alternation bounded auxiliary pushdown automata (Q3718176) (← links)
- (Q3852167) (← links)
- Space-Time Trade-Offs in Structured Programming (Q3862426) (← links)
- External Hashing Schemes for Collections of Data Structures (Q3862431) (← links)
- A Separator Theorem for Planar Graphs (Q3869371) (← links)
- A constructive generalization of the borel-cantelli lemma with application to the complexity of infinite strings (Q3872452) (← links)
- Generalized Nested Dissection (Q3875202) (← links)
- Addition Chain Methods for the Evaluation of Specific Polynomials (Q3893297) (← links)
- Applications of a Planar Separator Theorem (Q3906439) (← links)
- (Q3906497) (← links)
- Covering Graphs by Simple Circuits (Q3922184) (← links)
- (Q3957950) (← links)
- Playing games of incomplete information (Q3975930) (← links)
- A Monte-Carlo Algorithm for Estimating the Permanent (Q4032938) (← links)
- (Q4068103) (← links)
- Reduction (Q4077431) (← links)
- (Q4080721) (← links)
- Space and Time Hierarchies for Classes of Control Structures and Data Structures (Q4099200) (← links)
- Multidimensional Searching Problems (Q4099207) (← links)
- A Linear Time Algorithm for Deciding Subject Security (Q4130983) (← links)
- Word Problems Solvable in Logspace (Q4131647) (← links)
- (Q4134929) (← links)
- (Q4134963) (← links)
- (Q4134996) (← links)
- (Q4136563) (← links)
- (Q4151711) (← links)
- Polynomials with 0-1 Coefficients That are Hard to Evaluate (Q4151728) (← links)
- (Q4152749) (← links)
- Preserving average proximity in arrays (Q4157931) (← links)
- (Q4158480) (← links)
- (Q4195939) (← links)
- (Q4195944) (← links)
- (Q4195948) (← links)
- Reconstructing Algebraic Functions from Mixed Data (Q4210162) (← links)
- (Q4224901) (← links)
- (Q4224916) (← links)
- (Q4230375) (← links)
- (Q4263678) (← links)
- Subquadratic Simulations of Balanced Formulae by Branching Programs (Q4302284) (← links)
- (Q4341754) (← links)
- (Q4343414) (← links)
