You are on the new improved site. You can view the old site in view-only mode here until June 27, 2026

Filter Results

Search all journals

Enter search terms…

Advanced search

/

About

About Sage
About Sage Journals
Privacy Policy
Terms of Use
Contact Us
Help

Information for

Authors
Editors
Librarians
Researchers
Reviewers
Frequently asked questions

Copyright © 2026 by Sage Publications.京ICP备09090397号-11

Search results

Search results page

Articles (16)

Journals (0)

1-10 of 16 results for PSPACE-hardness

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: On the Complexity of Motion Planning for Multiple Independent Objects;PSPACE- Hardness of the "Warehouseman's Problem"

Retricted access

Research article

First published 1984-12

On the Complexity of Motion Planning for Multiple Independent Objects;PSPACE- Hardness of the "Warehouseman's Problem"

J.E. Hopcroft, J.T. Schwartz, M. Sharir

The International Journal of Robotics Research

Select article: Complexity of the Soundness Problem of Workflow Nets

Retricted access

Research article

First published 2014-4

Complexity of the Soundness Problem of Workflow Nets

GuanJun Liu, Jun Sun, Yang Liu [...]

Fundamenta Informaticae

Select article: Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows

Retricted access

Research article

First published 2016

Twelve Years of QBF Evaluations: QSAT Is PSPACE-Hard and It Shows

Paolo Marin, Massimo Narizzano, Luca Pulina [...]

Fundamenta Informaticae

Select article: On the hardness of unlabeled multi-robot motion planning

Retricted access

Research article

First published 2016-12

On the hardness of unlabeled multi-robot motion planning

Kiril Solovey, Dan Halperin

The International Journal of Robotics Research

Select article: Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities

Retricted access

Research article

First published 2016-3-4

Completeness Results for Generalized Communication-free Petri Nets with Arbitrary Arc Multiplicities

Ernst W. Mayr, Jeremias Weihmann

Fundamenta Informaticae

Select article: The Nondeterministic Information Logic NIL is PSPACE-complete

Retricted access

Research article

First published 2000-7

The Nondeterministic Information Logic NIL is PSPACE-complete

Stéphane Demri

Fundamenta Informaticae

Select article: Structural Liveness of Immediate Observation Petri Nets

Retricted access

Research article

First published 2022

Structural Liveness of Immediate Observation Petri Nets

Petr Jančar, Jiří Valůšek

Fundamenta Informaticae

Select article: The Complexity of Fine Motion Planning

Retricted access

Research article

First published 1988-04

The Complexity of Fine Motion Planning

B.K. Natarajan

The International Journal of Robotics Research

Select article: On the Computational Complexity of Partial Word Automata Problems

Retricted access

Research article

First published 2016-12-24

On the Computational Complexity of Partial Word Automata Problems

Markus Holzer, Sebastian Jakobi, Matthias Wendlandt

Fundamenta Informaticae

Select article: A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems

Retricted access

Research article

First published 2021

A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems

Kuize Zhang

Fundamenta Informaticae

1
2
10 / page

Article type

Publication date

Subjects

Access