Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 21 for “"PSPACE"”.
-
Subway Shuffle, 1 × 1 Rush Hour, and Cooperative Chess Puzzles: Computational Complexity of Puzzles
… a token across a target edge. We show that it is PSPACE-complete to determine whether a particular target edge can be moved across through a sequence of Oriented Subway Shuffle moves. We show how this can be interpreted in the context of the motion-planning-through-gadgets framework, thus showing …
-
The complexity of description logics with concrete domains
… DL ALC extended with a concrete domain D, is PSpace-complete if reasoning with D is in PSpace; (ii) for many seemingly "harmless" extensions of ALC(D), such as the extension with acyclic TBoxes, role conjunction, and inverse roles, the complexity of reasoning leaps from PSpace-completeness to …
-
To and Fro Between Tableaus and Automata for Description Logics
… fuer Implementierungen und fuer den Nachweis von PSPACE- und NEXPTIME-Resultaten, waehrend Automaten sich besonders fuer EXPTIME-Resultate anbieten. Zudem ermoeglichen sie eine vom Standpunkt der Theorie aus elegantere Handhabung von unendlichen Strukturen, eignen sich aber wesentlich schlechter …
-
On the computational complexity of portal and push-pull block puzzles
… a popular video game, is shown to be NP-hard or PSPACE-complete depending on the game mechanics allowed. Push-pull block puzzles are games, similar to Sokoban, which involve moving a 'robot' on a square grid with obstacles and blocks that can be pushed or pulled by the robot into adjacent …
-
Probabilistic methods in combinatorial and stochastic optimization
… policies and Arthur-Merlin games which yields PSPACE-hardness results for numerous questions regarding adaptive policies.
-
A framework for proving the computational intractability of motion planning problems
… a separation between containment in P and PSPACE-completeness, and for team imperfect information games a separation between containment in P and NEXPTIME-completeness. Our model builds on and generalizes several other proof techniques for motion planning problems and games. This thesis …
-
Red-blue and standard pebble games : complexity and applications in the sequential and parallel models
… the standard pebbling game on any given DAG is PSPACE-hard [GLT79]. Furthermore, it was more recently shown that the standard pebble game is hard to approximate to any constant additive factor [CLNV15]. In this thesis, we present a simpler proof of the result presented in [CLNV15] and strengthen …
-
Modern Interactive Proofs
… non-signaling proofs are characterized by PSPACE, and that non- signaling proofs with poly(𝑛)- provers are characterized by EXP. However, the power of 𝑘-prover non-signaling proofs, for 2 < 𝑘 < poly(𝑛) remained an open problem. We show that 𝑘-prover non-signaling proofs (with negligible …
-
The Computational Complexity of Some Games and Puzzles With Theoretical Applications
… generalization for k greater or equal to 3 is PSPACE-hard. </p> <p>Finally, we study the Scrabble game, a word game where players are trying to </p> <p>form words in a crossword fashion by placing letter tiles on a grid board. We prove </p> <p>that a generalized version of Scrabble is …
-
Stochastic Assignment with Expiration
… at unknown stochastic times. This problem is PSPACE hard; thus we first focus on the subproblem where each offline node can be matched at most once and aim to develop algorithms that achieve large expected overall values from the matchings. A decision maker (DM) must balance obtaining a …
-
Verification and Enforcement of State-Based Notions of Opacity in Discrete Event Systems
… the verification of initial-state opacity is a PSPACE-complete problem. In order to verify K-step opacity, we introduce the K-delay state estimator which constructs the estimate of the state of the system K observations ago (K-delayed state estimates) for a given non-deterministic finite …
-
Planning Practical Paths in High-Dimensional Space
… in the environment, which is known to be PSPACE-complete in the robot's DOF. As a consequence heuristic sampling-based approaches have been developed to solve high-dimensional real-world path planning problems. A shortcoming of the current sampling-based algorithms is that they can obtain …
-
A Dual Perspective on Computational Complexity
… open, as do much weaker conjectures such as P ≠ PSPACE. The aforementioned discrepancy between what is known and what is believed is fairly representative of the state of the art in complexity theory, which invites the question: is it inherent? Are lower bounds somehow inherently harder to prove …
-
The computational complexity of prefix classes of logical theories
… the $\Pi\sb1$ and $\Sigma\sb2$ formulas are in $PSPACE$. An interpretation of this theory in the first-order theory of the binary tree with the prefix order and two successor functions shows that the formulas in $\Sigma\sb{m+1}$ have an $NSPACE$(exp$\sb{m}(c\sb{m}n/$log$\sp2n$)) lower bound.
-
Random games
… problems, and we show that the problem is PSPACE-hard.
-
Incremental sampling based algorithms for state estimation
… a large POMDP problem from scratch, which is PSPACE-hard, approximate solutions of smaller problems can be used to guide the search for the optimal control policy.
-
PCPs for Arthur-Merlin games and communication protocols
… levels of the Polynomial Hierarchy, and for PSPACE; however, we suggest that the result for AM might be of particular significance for attempts to derandomnize this class. To test this notion, we pose some 'Randomized Optimization Hypotheses' related to our stochastic CSPs that (in light of …
-
Constructions, Lower Bounds, and New Directions in Cryptography and Computational Complexity
… and decide problems in P − NC assuming EXP ≠ PSPACE. Finally, we initiate the study of log-space streaming computation of cryptographic primitives. We observe that the work on Cryptography in NC0 [AIK06a] yields a non-black-box construction of a one-way function computable in an O(log n)-space …
-
Constraint propagation and variable ordering heuristics for solving Constrained Partial CP-nets
… the algorithm for dominance testing is PSPACE-complete. However, it can be reduced to NP or can also be solved in polynomial time.
-
Caracterização aritmética em primeira ordem de funções computáveis em espaço polinomial
Nesta tese desenvolvemos uma caracterização das funções computáveis em espaço polinomial por meio da lógica de primeira ordem de seqüência binárias. Provamos, também, um resultado análogo ao Teorema de Parikh sobre limitação polinomial no tamanho de crescimento das funções de…níveis em tal sistema. …
Page 1 of 2