Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540133315, 9783540388562

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Reduction to NP-complete problems by interpretations

Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer Science ◽

10.1007/3-540-13331-3_51 ◽

1984 ◽

pp. 357-365 ◽

Cited By ~ 25

Author(s):

Elias Dahlhaus

Keyword(s):

Complete Problems ◽

Np Complete

Download Full-text

Implicit definability of finite binary trees by sets of equations

Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer Science ◽

10.1007/3-540-13331-3_49 ◽

1984 ◽

pp. 320-332

Author(s):

Jerzy Tiuryn

Keyword(s):

Binary Trees

Download Full-text

P-mitotic sets

Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer Science ◽

10.1007/3-540-13331-3_30 ◽

1984 ◽

pp. 1-23 ◽

Cited By ~ 12

Author(s):

Klaus Ambos-Spies

Download Full-text

Recurrence relations for the number of labeled structures on a finite set

Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer Science ◽

10.1007/3-540-13331-3_32 ◽

1984 ◽

pp. 43-61 ◽

Cited By ~ 3

Author(s):

Chr. Blatter ◽

E. Specker

Keyword(s):

Recurrence Relations ◽

Finite Set

Download Full-text

Second order spectra

Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer Science ◽

10.1007/3-540-13331-3_53 ◽

1984 ◽

pp. 380-389

Author(s):

Bruno Scarpellini

Keyword(s):

Second Order

Download Full-text

Recursively enumerable extensions of R1 by finite functions

Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer Science ◽

10.1007/3-540-13331-3_33 ◽

1984 ◽

pp. 62-76 ◽

Cited By ~ 3

Author(s):

W. Menzel ◽

V. Sperschneider

Keyword(s):

Recursively Enumerable

Download Full-text

On the complement of one complexity class in another

Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer Science ◽

10.1007/3-540-13331-3_34 ◽

1984 ◽

pp. 77-87 ◽

Cited By ~ 2

Author(s):

Diana Schmidt

Keyword(s):

Complexity Class

Download Full-text

Bounds for Hodes - Specker theorem

Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer Science ◽

10.1007/3-540-13331-3_57 ◽

1984 ◽

pp. 421-445 ◽

Cited By ~ 5

Author(s):

Pavel Pudlák

Download Full-text

Equivalence relations, invariants, and normal forms, II

Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer Science ◽

10.1007/3-540-13331-3_31 ◽

1984 ◽

pp. 24-42 ◽

Cited By ~ 5

Author(s):

Andreas Blass ◽

Yuri Gurevich

Keyword(s):

Normal Forms ◽

Equivalence Relations

Download Full-text

Proving lower bounds on the monotone complexity of Boolean functions

Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer Science ◽

10.1007/3-540-13331-3_58 ◽

1984 ◽

pp. 446-456 ◽

Cited By ~ 1

Author(s):

Ingo Wegener

Keyword(s):

Lower Bounds ◽

Boolean Functions

Download Full-text

Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Reduction to NP-complete problems by interpretations

Implicit definability of finite binary trees by sets of equations

P-mitotic sets

Recurrence relations for the number of labeled structures on a finite set

Second order spectra

Recursively enumerable extensions of R1 by finite functions

On the complement of one complexity class in another

Bounds for Hodes - Specker theorem

Equivalence relations, invariants, and normal forms, II

Proving lower bounds on the monotone complexity of Boolean functions

Logic and Machines: Decision Problems and Complexity - Lecture Notes in Computer Science
Latest Publications