Find link

language:

Find link is a tool written by Edward Betts.

searching for PSPACE 68 found (182 total)

alternate case: pSPACE

Generalized game (385 words) [view diff] exact match in snippet view article find links to article

win for the first player in a given position is PSPACE-complete. Generalized hex and reversi are PSPACE-complete. For many generalized games which may

Transdichotomous model (503 words) [view diff] exact match in snippet view article find links to article

models with unlimited precision are unreasonably powerful (able to solve PSPACE-complete problems in polynomial time). The transdichotomous model makes

Context-sensitive grammar (3,503 words) [view diff] exact match in snippet view article find links to article

context-sensitive grammar G, is PSPACE-complete. Moreover, there are context-sensitive grammars whose languages are PSPACE-complete. In other words, there

Kosaburo Hashiguchi (308 words) [view diff] exact match in snippet view article find links to article

smallest examples.[H88] A simpler method, showing also that the problem is PSPACE-complete, was provided in 2005 by Kirsten. Earlier, in 1979, Hashiguchi

Japaridze's polymodal logic (1,202 words) [view diff] exact match in snippet view article find links to article

to the class of all GLP-spaces. The problem of being a theorem of GLP is PSPACE-complete. So is the same problem restricted to only variable-free formulas

Equivalence problem (148 words) [view diff] exact match in snippet view article find links to article

of finite-state automata, equivalence is decidable, and the problem is PSPACE-complete. Further, in the case of deterministic pushdown automata, equivalence

Havannah (board game) (989 words) [view diff] exact match in snippet view article

board. During this competition the pie rule is used. Solving Havannah is PSPACE-complete with respect to the size of the input graph. The proof is by a

Poset game (803 words) [view diff] exact match in snippet view article find links to article

Deciding the winner of an arbitrary finite poset game is PSPACE-complete. This means that unless P=PSPACE, computing the Grundy value of an arbitrary poset game

Col (game) (502 words) [view diff] exact match in snippet view article

the outcome in Snort is PSPACE-complete on general graphs. This is proven by reducing partizan node Kayles, which is PSPACE-complete, to a game of Snort

Mahjong solitaire (1,049 words) [view diff] exact match in snippet view article find links to article

removing all tiles is PSPACE-complete, and the game is NP-complete if looking below tiles is allowed. It has been proven that it is PSPACE-hard to approximate

TwixT (1,588 words) [view diff] exact match in snippet view article find links to article

player can achieve this, the game is a draw. TwixT has been proven to be PSPACE-complete for determining the game value, via a reduction from Hex. TwixT

Lists of unsolved problems (120 words) [view diff] exact match in snippet view article find links to article

hypothetical technologies List of NP-complete problems List of paradoxes List of PSPACE-complete problems List of undecidable problems List of unsolved deaths Lists

Size-change termination principle (640 words) [view diff] exact match in snippet view article find links to article

but a negative answer means "don't know". The decision problem for SCT is PSPACE-complete; however, there exists an algorithm that computes an approximation

Lists of problems (36 words) [view diff] exact match in snippet view article find links to article

of undecidable problems Lists of unsolved problems List of NP-complete problems List of PSPACE-complete problems This article includes a list of lists.

Circuit (computer science) (857 words) [view diff] exact match in snippet view article

ISBN 978-3-540-64310-4. Yang, Ke (2001). "Integer Circuit Evaluation Is PSPACE-Complete". Journal of Computer and System Sciences. 63 (2, September 2001):

Boolean satisfiability problem (5,045 words) [view diff] exact match in snippet view article find links to article

Boolean formula problem (QBF), which can be shown to be PSPACE-complete. It is widely believed that PSPACE-complete problems are strictly harder than any problem

Kōnane (1,057 words) [view diff] exact match in snippet view article find links to article

player eventually cannot perform a capture. Bob Hearn proved that Kōnane is PSPACE-complete with respect to the dimensions of the board, by a reduction from

Online algorithm (703 words) [view diff] exact match in snippet view article find links to article

between the online and offline algorithms' performance. This problem is PSPACE-complete. There are many formal problems that offer more than one online

2004 European Parliament election in the Czech Republic (363 words) [view diff] case mismatch in snippet view article find links to article

Retrieved 1 August 2016. Holpuch, Jan. "EU.ODS.cz / ODS a volby do EP". euods.pspace.cz. Archived from the original on 10 October 2007. Retrieved 15 March 2017

Context-sensitive language (1,340 words) [view diff] exact match in snippet view article find links to article

grammar, or by an arbitrary deterministic context-sensitive grammar, is a PSPACE-complete problem. Linear bounded automaton List of parser generators for

Nondeterministic Turing machine (1,626 words) [view diff] exact match in snippet view article find links to article

{\mathsf {NP}}} and N P ≠ P S P A C E {\displaystyle {\mathsf {NP}}\neq {\mathsf {PSPACE}}} . If this is not true then the figure should look different.

Strategy-stealing argument (1,155 words) [view diff] exact match in snippet view article find links to article

Ofer Grossman proved that the problem of finding a winning strategy is PSPACE-hard in two kinds of games in which strategy-stealing arguments were used:

Richard Statman (249 words) [view diff] exact match in snippet view article find links to article

proof that the type inhabitation problem in simply typed lambda calculus is PSPACE-complete, lower bounds on simply typed lambda calculus, logical relations

Dynamic epistemic logic (8,012 words) [view diff] exact match in snippet view article find links to article

problem is solvable in polynomial time and its satisfiability problem is PSPACE-complete. Muddy children puzzle formalized with PAL: Here are some of the

Kayles (907 words) [view diff] exact match in snippet view article find links to article

wins. Schaefer (1978) proved that deciding the outcome of these games is PSPACE-complete. The same result holds for a partisan version of node Kayles, in

Word chain (568 words) [view diff] exact match in snippet view article find links to article

variants exist, such as Ancient Greek skolion. Generalized geography, a PSPACE-complete problem in computational complexity theory. Wise, Debra; Sandra

Deterministic finite automaton (3,736 words) [view diff] exact match in snippet view article find links to article

solved efficiently also for NFAs. The non-universality problem for NFAs is PSPACE complete since there are small NFAs with shortest rejecting word in exponential

Simplex algorithm (6,259 words) [view diff] exact match in snippet view article find links to article

computing its output is PSPACE-complete. In 2015, this was strengthened to show that computing the output of Dantzig's pivot rule is PSPACE-complete. Analyzing

Instant Insanity (1,467 words) [view diff] exact match in snippet view article find links to article

proved that this game is PSPACE-complete, which illustrates the observation that NP-complete puzzles tend to lead to PSPACE-complete games. Devil's Dice

S3 (programming language) (1,025 words) [view diff] exact match in snippet view article

entry point to the program, is reproduced here: GLOBAL STATIC (<STATUS 5;PSPACE 10001; TEMPLATE>) PROC KERMIT_THE_FROG IS ((<LIT "COMMAND">) REF()BYTE OPTION

Rod Downey (1,235 words) [view diff] exact match in snippet view article find links to article

"Fixed-parameter tractability and completeness. IV. On completeness for W[P] and PSPACE analogues", Annals of Pure and Applied Logic, 73 (3): 235–276, doi:10

Separation logic (3,646 words) [view diff] exact match in snippet view article find links to article

logic parameterized over the sorts of locations and data can be shown to be PSPACE-complete. An algorithm for solving this fragment in DPLL(T)-based SMT solvers

Online optimization (404 words) [view diff] exact match in snippet view article find links to article

between the online and offline algorithms' performance. This problem is PSPACE-complete. There are many formal problems that offer more than one online

Solved game (2,786 words) [view diff] exact match in snippet view article find links to article

solving Hex on an N×N board is unlikely as the problem has been shown to be PSPACE-complete.[citation needed] If Hex is played on an N×(N + 1) board then the

Real RAM (826 words) [view diff] exact match in snippet view article find links to article

real RAM unreasonable amounts of computational power, enabling it to solve PSPACE-complete problems in polynomial time. When analyzing algorithms for the

Giorgi Japaridze (2,628 words) [view diff] exact match in snippet view article find links to article

link]". Logic Journal of the IGPL 22 (2014), pages 982-991. I. Shapirovsky, "PSPACE-decidability of Japaridze's polymodal logic". Advances in Modal Logic 7

Richard Lipton (1,648 words) [view diff] exact match in snippet view article find links to article

interactive proof systems Karloff-Nisan and Shamir, including the result IP = PSPACE. In the area of game theory, more specifically of non-cooperative games

Regular language (3,424 words) [view diff] exact match in snippet view article find links to article

already for a singleton alphabet. For larger alphabets, that problem is PSPACE-complete. If regular expressions are extended to allow also a squaring operator

Index of computing articles (1,384 words) [view diff] exact match in snippet view article find links to article

Preprocessor – Primitive recursive function – Programming language – Prolog – PSPACE-complete – Pulse-code modulation (PCM) – Pushdown automaton – Python QuarkXPress

Maker-Breaker game (3,409 words) [view diff] exact match in snippet view article find links to article

Maker-Breaker game called an Avoider-Enforcer game. Maker-Breaker game is PSPACE-complete even if the size of each set is restricted to 6. The first result

Lemmings (video game) (5,750 words) [view diff] exact match in snippet view article

Lemmings is NP-hard. Later, Giovanni Viglietta showed that the task is PSPACE-complete, even for levels where there is only one lemming to save. In 2010

Entscheidungsproblem (2,642 words) [view diff] exact match in snippet view article find links to article

) {\displaystyle {\rm {{Sat}([\exists ^{n}\forall \exists ]_{=})}}} are PSPACE-complete (Section 5.4.3). Börger et al. (2001) describes the level of computational

Alternating finite automaton (808 words) [view diff] exact match in snippet view article find links to article

equivalence problem (do two input AFAs recognize the same language) are PSPACE-complete for AFAs: Theorems 23, 24, 25 . Chandra, Ashok K.; Kozen, Dexter

Turing Tumble (799 words) [view diff] exact match in snippet view article find links to article

follows because the game is P-complete by the circuit value problem and PSPACE-complete if an exponential number of marbles is allowed. The device has

Games, Puzzles, and Computation (548 words) [view diff] exact match in snippet view article find links to article

computationally difficult: sudoku is NP-complete, Rush Hour and reversi are PSPACE-complete, and chess is EXPTIME-complete. Beyond proving new results along

Linear temporal logic (1,832 words) [view diff] exact match in snippet view article find links to article

AG(EF(p)). Model checking and satisfiability against an LTL formula are PSPACE-complete problems. LTL synthesis and the problem of verification of games

James Renegar (1,009 words) [view diff] exact match in snippet view article find links to article

S2CID 206798056. 1988(over 740 citations) Regenar, James (April 1988). "A faster PSPACE algorithm for deciding the existential theory of the reals" (PDF). Technical

Finite model theory (3,107 words) [view diff] exact match in snippet view article find links to article

determining whether a given sentence has probability tending to zero or to one is PSPACE-complete. A similar analysis has been performed for more expressive logics

List of NP-complete problems (2,746 words) [view diff] exact match in snippet view article find links to article

of the reals § Complete problems Karp's 21 NP-complete problems List of PSPACE-complete problems Reduction (complexity) Grigoriev & Bodlaender (2007).

Modal μ-calculus (1,816 words) [view diff] exact match in snippet view article find links to article

checking, satisfiability and validity problems of linear modal μ-calculus are PSPACE-complete. Finite model theory Alternation-free modal μ-calculus Scott, Dana;

Linear logic (2,947 words) [view diff] exact match in snippet view article find links to article

multiplicatives and additives (i.e., exponential-free). MALL entailment is PSPACE-complete. Multiplicative-exponential linear logic (MELL): only multiplicatives

Lemke–Howson algorithm (1,391 words) [view diff] exact match in snippet view article find links to article

pure strategies in the game. Subsequently, it has been shown that it is PSPACE-complete to find any of the solutions that can be obtained with the Lemke–Howson

Distributed computing (6,666 words) [view diff] exact match in snippet view article find links to article

non-deterministic) finite-state machines can reach a deadlock. This problem is PSPACE-complete, i.e., it is decidable, but not likely that there is an efficient

Timed automaton (1,654 words) [view diff] exact match in snippet view article find links to article

automaton and checking whether it accepts the empty language. This problem is PSPACE-complete.: 207 The universality problem of non-deterministic timed automaton

Graph coloring game (4,118 words) [view diff] exact match in snippet view article find links to article

interesting open problem". Only in 2020 it was proved that the game is PSPACE-Complete. Acyclic coloring. Every graph G {\displaystyle G} with acyclic

Action description language (1,823 words) [view diff] exact match in snippet view article find links to article

and thus ADL is strictly more brief than STRIPS. ADL planning is still a PSPACE-complete problem. Most of the algorithms polynomial space even if the preconditions

Metric interval temporal logic (1,357 words) [view diff] exact match in snippet view article find links to article

over a signal is EXPSPACE-complete, while satisfiability for MITL0,∞ is PSPACE-complete. R. Alur, T. Feder, and T.A. Henzinger. The Benefits of Relaxing

Computation tree logic (2,913 words) [view diff] exact match in snippet view article find links to article

semantics. We label states. QCTL* = QCTL = MSO over graphs. Model checking is PSPACE-complete but satisfiability is undecidable. A reduction from the model-checking

Computational hardness assumption (3,303 words) [view diff] exact match in snippet view article find links to article

complexity class C {\displaystyle C} , in particular NP-hard (but often also PSPACE-hard, PPAD-hard, etc.). This means that they are at least as hard as any

Security of cryptographic hash functions (1,823 words) [view diff] exact match in snippet view article find links to article

of certain elements in this group. This is supposed to be hard, at least PSPACE-complete.[dubious – discuss] For this hash, an attack was eventually discovered

Quantum refereed game (3,254 words) [view diff] exact match in snippet view article find links to article

32nd AMC Symposium on Theory of Computing: 608–617. Watrous, J (2003). "PSPACE has constant-round quantum interactive proof systems". Theoretical Computer

Zero-knowledge proof (7,431 words) [view diff] exact match in snippet view article find links to article

unbreakable encryption, there are zero-knowledge proofs for all problems in IP = PSPACE, or in other words, anything that can be proved by an interactive proof

Travelling salesman problem (11,633 words) [view diff] exact match in snippet view article find links to article

Euclidean TSP is known to be in the Counting Hierarchy, a subclass of PSPACE. With arbitrary real coordinates, Euclidean TSP cannot be in such classes

Congestion game (7,315 words) [view diff] exact match in snippet view article find links to article

implies that finding a Nash equilibrium reachable from a specified state is PSPACE-complete. Every problem in the class PLS can be presented as a game whose

Heyting algebra (6,294 words) [view diff] exact match in snippet view article find links to article

the problem was established by Richard Statman in 1979, who showed it was PSPACE-complete and hence at least as hard as deciding equations of Boolean algebra

Rado graph (5,168 words) [view diff] exact match in snippet view article find links to article

sentence can be done more quickly than exponential time, as the problem is PSPACE-complete. The Rado graph is ultrahomogeneous, and thus is the Fraïssé limit

Logic of graphs (5,029 words) [view diff] exact match in snippet view article find links to article

sentence has probability tending to zero or to one is high: the problem is PSPACE-complete. If a first-order graph property has probability tending to one

Metric temporal logic (3,231 words) [view diff] exact match in snippet view article find links to article

\triangleright _{I}\neg \psi } . The satisfiability of ECL over signals is PSPACE-complete. A MTL-formula in positive normal form is defined almost as any