Reduction to NP-complete problems by interpretations-Reference-Cited by-同舟云学术

Reduction to NP-complete problems by interpretations

Published:1984 Issue: Volume: Page:357-365
ISSN:0302-9743
Container-title:Logic and Machines: Decision Problems and Complexity
language:
Short-container-title:

Author:

Dahlhaus Elias

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-13331-3_51.pdf

Reference12 articles.

1. Asser "Das Representantenproblem im Prädikatenkalkül der ersten Stufe mit Identität", ZML 1,p.252–263, 1955.

2. Dahlhaus "Kombinatorische und logische Eigenschaften von Reduktionen auf einige vollständige Probleme in NP und NL", Doctoral Dissertation, TU Berlin, 1982.

3. Enderton: "A Mathematical Introduction to Logic", Academic Press, 1972.

4. Fagin: "Generalized First Order Spectra and Polynomial Time Recognizable Sets", Karp (ed.) "Complexity of Computations"; SIAM-AMS Proc. 7, p. 27–41.

5. Hartmanis Immerman Mahaney: "One-Way Log Tape Reductions", IEEE-FOCS 19, p. 65–72, 1978.

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Independence-friendly logic without Henkin quantification;Archive for Mathematical Logic;2021-06-16

2. Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs;Theory of Computing Systems;2017-06-07

3. Independence-Friendly Logic Without Henkin Quantification;Logic, Language, Information, and Computation;2017

4. On the power of deep pushdown stacks;Acta Informatica;2009-09-03

5. Parameterized Complexity Classes under Logical Reductions;Mathematical Foundations of Computer Science 2009;2009