( en | de | ru )

 

Disambiguation of "Lipton, Richard J."

Author of the publication

copydeleteadd this publication to your clipboard
Polynomials that Sign Represent Parity and Descartes' Rule of Signs.

, , , and . Comput. Complex., 17 (3): 377-406 (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Lipton Chan

Richard J Saley

Richard J Brunt

Richard J Fuchs

Richard J Watts

 

Other publications of authors with the same name

Social Processes and Proofs of Theorems and Programs, , and . Communications of the ACM, 22 (5): 271--280 (May 1979)Graph Pricing Problem on Bounded Treewidth, Bounded Genus and k-Partite Graphs., , , and . Chic. J. Theor. Comput. Sci., (2013)Query Size Estimation by Adaptive Sampling., and . J. Comput. Syst. Sci., 51 (1): 18-25 (1995)A Lower Bound of the ½n² on Linear Search Programs for the Knapsack Problem., and . J. Comput. Syst. Sci., 16 (3): 413-417 (1978)The Expressive Power of Multi-Parent Creation in a Monotonic Access Control Model., , and . CSFW, page 148-156. IEEE Computer Society, (1992)DNA2DNA computations: A potential "killer app?"., , and . DNA Based Computers, volume 48 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 161-172. DIMACS/AMS, (1997)On Bounded Round Multi-Prover Interactive Proof Systems., , and . SCT, page 45-54. IEEE Computer Society, (1990)On the Complexity of Intersecting Finite State Automata., , and . CCC, page 229-234. IEEE Computer Society, (2000)A Linear Time Algorithm for Deciding Security, , and . FOCS, page 33-41. IEEE Computer Society, (1976)Polynomials with 0-1 Coefficients that Are Hard to Evaluate. FOCS, page 6-10. IEEE Computer Society, (1975)