Author of the publication

A Normal Form for Arithmetical Representation of NP-Sets.

, and . J. Comput. Syst. Sci., 27 (3): 378-388 (1983)

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

The Relation of A to Prov A in the Lindenbaum Sentence Algebra.. J. Symb. Log., 38 (2): 295-298 (1973)Extensions of Arithmetic For Proving Termination of Computations., and . J. Symb. Log., 54 (3): 779-794 (1989)A Survey of Ordinal Interpretations of Type epsilon0for Termination of Rewriting Systems., and . CTRS, volume 516 of Lecture Notes in Computer Science, page 137-142. Springer, (1990)Uniform Normal Form for General Time-Bounded Complexity Classes., and . J. Comput. Syst. Sci., 32 (3): 363-369 (1986)An Arithmetical Characterization of NP., and . Theor. Comput. Sci., (1982)A Normal Form for Arithmetical Representation of NP-Sets., and . J. Comput. Syst. Sci., 27 (3): 378-388 (1983)