Combinatorial problems over power sets

This publication has 10 references indexed in Scilit:

• Structure preserving reductions among convex optimization problems
  Journal of Computer and System Sciences, 1980
• Node-Deletion NP-Complete Problems
  SIAM Journal on Computing, 1979
• The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems
  Journal of the ACM, 1979
• The Complexity of Enumeration and Reliability Problems
  SIAM Journal on Computing, 1979
• Completeness classes in algebra
  Published by Association for Computing Machinery (ACM) ,1979
• The complexity of computing the permanent
  Theoretical Computer Science, 1979
• On Structure Preserving Reductions
  SIAM Journal on Computing, 1978
• On the complexity of the Maximum Subgraph Problem
  Published by Association for Computing Machinery (ACM) ,1978
• On the structure of combinatorial problems and structure preserving reductions
  Published by Springer Nature ,1977
• Non-deterministic polynomial optimization problems and their approximation
  Lecture Notes in Computer Science, 1977