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 (34)

Journals (0)

1-10 of 34 results for PSPACE-completeness

Sort by:

Relevance

Select all

Select all

Sort by:

Relevance

Select article: Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes

Retricted access

Research article

First published 2003-10

Solving a PSPACE-Complete Problem by Recognizing P Systems with Restricted Active Membranes

Artiom Alhazov, Carlos Martín-Vide, Linqiang Pan

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: Stonehenge: Outcome of All First Moves and PSPACE-Completeness

Retricted access

Research article

First published 2010-3-1

Stonehenge: Outcome of All First Moves and PSPACE-Completeness

Yasuhiko Takenaga, Hikari Mori, Shigeki Iwata

ICGA Journal: The Journal of the Computer Games Community

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: Strong Reductions and Isomorphism of Complete Sets

Retricted access

Research article

First published 2014-9

Strong Reductions and Isomorphism of Complete Sets

Ryan C. Harkins, John M. Hitchcock, A. Pavan

Computability

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: Computational Complexity of Multimodal Logics \newline Based on Rough Sets

Retricted access

Research article

First published 2000-12

Computational Complexity of Multimodal Logics \newline Based on Rough Sets

Stéphane Demri, Jarosław Stepaniuk

Fundamenta Informaticae

Select article: A Computational Trichotomy for Connectivity of Boolean Satisfiability

Open access

Research article

First published 2012-8

A Computational Trichotomy for Connectivity of Boolean Satisfiability

Konrad W. Schwerdtfeger

Journal on Satisfiability,Boolean Modelling and Computation

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: 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

1
2
3
4
10 / page

Article type

Publication date

Subjects

Access