Author of the publication

Uniform, Integral and Feasible Proofs for the Determinant Identities.

, and . Electron. Colloquium Comput. Complex., (2018)

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.

 

Other publications of authors with the same name

Uniform, Integral and Feasible Proofs for the Determinant Identities., and . Electron. Colloquium Comput. Complex., (2018)An Observation on Time-Storage Trade Off.. J. Comput. Syst. Sci., 9 (3): 308-316 (1974)A Hierarchy for Nondeterministic Time Complexity.. J. Comput. Syst. Sci., 7 (4): 343-353 (1973)Storage Requirements for Deterministic Polynomial Time Recognizable Languages, and . STOC, page 33-39. ACM, (1974)On the Number of Additions to Compute Specific Polynomials (Preliminary Version), and . STOC, page 342-347. ACM, (1974)Time-Bounded Random Access Machines, and . STOC, page 73-80. ACM, (1972)An Assertion Language for Data Structures., and . POPL, page 160-166. ACM Press, (1975)Two Applications of Inductive Counting for Complementation Problems., , , , and . SIAM J. Comput., 18 (3): 559-578 (1989)Erratum: SIAM J. Comput. 18(6): 1283 (1989).A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation, and . STOC, page 294-301. ACM, (1980)Theories for Subexponential-size Bounded-depth Frege Proofs., and . CSL, volume 23 of LIPIcs, page 296-315. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2013)