Author of the publication

copy delete add this publication to your clipboard
community post
history of this post
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations.

C. Kintala, and P. Fischer. SIAM J. Comput., 9 (1): 46-53 (1980)

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.

Patrick Kopper University of Stuttgart

GALÆXI Application: NASA Rotor 37M. Kurz, D. Kempf, M. Blind, P. Kopper, P. Offenhäuser, A. Schwarz, S. Starr, J. Keim, and A. Beck. Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.

GALÆXI Application: NASA Rotor 37M. Kurz, D. Kempf, M. Blind, P. Kopper, P. Offenhäuser, A. Schwarz, S. Starr, J. Keim, and A. Beck. Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.GALÆXI Verification: Convergence TestsM. Kurz, D. Kempf, M. Blind, P. Kopper, P. Offenhäuser, A. Schwarz, S. Starr, J. Keim, and A. Beck. Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.GALÆXI ScalingM. Kurz, D. Kempf, M. Blind, P. Kopper, P. Offenhäuser, A. Schwarz, S. Starr, J. Keim, and A. Beck. Dataset, (2024)Related to: Kempf, Daniel et al. “GALÆXI: Solving complex compressible flows with high-order discontinuous Galerkin methods on accelerator-based systems.” (2024). arXiv: 2404.12703.

C. Traut

C. Honold

Patrick Gralka University of Stuttgart

Patrick Maisenhölder University of Stuttgart

Other publications of authors with the same name

Turing Machines with a Schedule to KeepP. Fischer. Information and Control, 11 (1/2): 138-146 (July 1967)Translational methods and computational complexityS. Ruby, and P. Fischer. SWCT (FOCS), page 173-178. IEEE Computer Society, (1965)On formalisms for Turing machinesP. Fischer. SWCT (FOCS), page 68-75. IEEE Computer Society, (1964)Turing Machines with Several Read-Write Heads (Preliminary Report)A. Meyer, A. Rosenberg, and P. Fischer. SWAT (FOCS), page 117-127. IEEE Computer Society, (1967)Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations.C. Kintala, and P. Fischer. SIAM J. Comput., 9 (1): 46-53 (1980)Whether a Set of Multivalued Dependencies Implies a Join Dependency is NP-Hard.P. Fischer, and D. Tsou. SIAM J. Comput., 12 (2): 259-266 (1983)Nested Relations: A Step Forward - or Backward?P. Fischer. SIGMOD Conference, page 2. ACM Press, (1988)The Solvability of the Halting Problem for 2-State Post Machines.S. Aanderaa, and P. Fischer. J. ACM, 14 (4): 677-682 (1967)Further Schemes for Combining Matrix Algorithms.P. Fischer. ICALP, volume 14 of Lecture Notes in Computer Science, page 428-436. Springer, (1974)Real Time Counter Machines (Preliminary Version)P. Fischer, A. Meyer, and A. Rosenberg. SWAT (FOCS), page 148-154. IEEE Computer Society, (1967)