The following pages link to Richard J. Lipton (Q181990):
Displaying 50 items.
- Amplifying circuit lower bounds against polynomial time, with applications (Q354644) (← links)
- Best-order streaming model (Q534570) (← links)
- Improved simulation of nondeterministic Turing machines (Q764330) (← links)
- Turing machines that take advice (Q787674) (← links)
- The processor identity problem (Q917266) (← links)
- Inapproximability results for combinatorial auctions with submodular utility functions (Q943868) (← links)
- Deterministically testing sparse polynomial identities of unbounded degree (Q976069) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- Polynomials that sign represent parity and Descartes' rule of signs (Q1024658) (← links)
- (Q1083201) (redirect page) (← links)
- Unbounded fan-in circuits and associative functions (Q1083202) (← links)
- Computing extremal and approximate distances in graphs having unit cost edges (Q1145636) (← links)
- Social processes and proofs of theorems and programs (Q1150266) (← links)
- (Q1162810) (redirect page) (← links)
- On the structure of sets in NP and other complexity classes (Q1162811) (← links)
- Set systems with no union of cardinality 0 modulo \(m\) (Q1175557) (← links)
- On games of incomplete information (Q1199525) (← links)
- Clocked adversaries for hashing (Q1209734) (← links)
- Complexity measures and hierarchies for the evaluation of integers and polynomials (Q1241288) (← links)
- Synchronization and computing capabilities of linear asynchronous structures (Q1242906) (← links)
- Evaluation of polynomials with super-preconditioning (Q1243131) (← links)
- The enforcement of security policies for computation (Q1248369) (← links)
- A batching method for coloring planar graphs (Q1252864) (← links)
- A probabilistic remark on algebraic program testing (Q1253894) (← links)
- A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem (Q1253918) (← links)
- Linear programming is log-space hard for P (Q1255780) (← links)
- On the complexity of computations under varying sets of primitives (Q1259164) (← links)
- PSPACE is provable by two provers in one round (Q1318475) (← links)
- On proving that a graph has no large clique: A connection with Ramsey theory (Q1351164) (← links)
- On the complexity of intersecting finite state automata and \(\mathcal{NL}\) versus \(\mathcal{NP}\) (Q1401330) (← links)
- A note on square rooting of time functions of Turing machines (Q1405791) (← links)
- Query size estimation by adaptive sampling (Q1900915) (← links)
- A \(p\)-adic approach to the Jacobian conjecture (Q2259175) (← links)
- Algorithms for modular counting of roots of multivariate polynomials (Q2482732) (← links)
- Symmetric polynomials over \(\mathbb Z_{m}\) and simultaneous communication protocols (Q2490262) (← links)
- Simple strategies for large zero-sum games with applications to complexity theory (Q2817668) (← links)
- Provably-Secure Remote Memory Attestation for Heap Overflow Protection (Q2827711) (← links)
- An Approximate Restatement of the Four-Color Theorem (Q2856478) (← links)
- People, Problems, and Proofs (Q2864226) (← links)
- Algorithms for Message Ferrying on Mobile ad hoc Networks (Q2920109) (← links)
- (Q2922358) (← links)
- Symmetric Functions Capture General Functions (Q3088060) (← links)
- (Q3128889) (← links)
- (Q3206972) (← links)
- (Q3210157) (← links)
- (Q3321475) (← links)
- Alternating Pushdown and Stack Automata (Q3325044) (← links)
- (Q3341893) (← links)
- (Q3355236) (← links)
- Provably Secure Virus Detection: Using The Observer Effect Against Malware. (Q4598168) (← links)
