Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection.

Mengel S, Skritek S

DOI: 10.1007/s00224-020-10002-z
Published: 2021
Container: Theory of computing systems
Publisher: Not recorded
Open access: yes

Credibility signals

limited evidence Score 45/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

cautionDOI registered: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
cautionDOI resolves: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
supportingOpen access status: Normalized open-access status: open. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1007/s00224-020-10002-z,
  title = {Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection.},
  author = {Mengel S and Skritek S},
  year = {2021},
  journal = {Theory of computing systems},
  doi = {10.1007/s00224-020-10002-z},
  url = {https://doi.org/10.1007/s00224-020-10002-z}
}

RIS

TY  - JOUR
TI  - Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection.
AU  - Mengel S
AU  - Skritek S
PY  - 2021
JO  - Theory of computing systems
DO  - 10.1007/s00224-020-10002-z
UR  - https://doi.org/10.1007/s00224-020-10002-z
ER  -

APA

S, M., & S, S. (2021). Characterizing Tractability of Simple Well-Designed Pattern Trees with Projection.. Theory of computing systems. https://doi.org/10.1007/s00224-020-10002-z

Source records

pubmed · retrieved 2026-09-25T22:22:52.821Z
europe-pmc · retrieved 2026-09-25T22:22:52.839Z
hal · retrieved 2026-09-25T22:22:52.897Z