Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"General Polynomial Decomposition and the s-1-Decomposition are NP-Hard."

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

Matthew Dickerson (1993)

> Home

Details and statistics

DOI: 10.1142/S0129054193000109

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijfcs/Dickerson93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijfcs/Dickerson93
Matthew Dickerson:
General Polynomial Decomposition and the s-1-Decomposition are NP-Hard. Int. J. Found. Comput. Sci. 4(2): 147-156 (1993)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.