
	Where results make sense

Topic: EXPSPACE

Related Topics

PSPACE

Complexity classes P and NP

DSpace

EXPTIME

In the News (Sat 12 Dec 09)

Northern Trust

Marvin Harrison

Peter Chernin

Gary Locke

Match Play

Penelope Cruz

Mickey Rourke

AR Rahman

Danny Boyle

Hugh Jackman

	EXPSPACE (Site not responding. Last check: 2007-10-21)
		A decision problem is in EXPSPACE-complete if it is in EXPSPACE, and every problem in EXPSPACE has a many-one reduction to it.
		EXPSPACE is a strict superset of EXPTIME, PSPACE, NP-complete, NP, and P.
		An example of an EXPSPACE-complete problem is the problem of recognizing whether two regular expressions represent different languages, where the expressions are limited to four operators: union, concatenation, the Kleene star (zero or more copies of an expression), and squaring (two copies of an expression).
	www.teachersparadise.com /ency/en/wikipedia/e/ex/expspace.html (243 words)

	expspace (Site not responding. Last check: 2007-10-21)
		A decision problem is in EXPSPACE-complete if it is in EXPSPACE, and every problem in EXPSPACE has a polynomial-time many-one reduction to it.
		EXPSPACE is a strict superset of PSPACE, NP-complete, NP, and P and is believed to be a strict superset of EXPTIME.
		If the Kleene star is left out, then that problem becomes NEXPTIME-complete, which is like EXPTIME-complete, except it is defined in terms of non-deterministic Turing machines rather than deterministic.
	www.yourencyclopedia.net /EXPSPACE.html (318 words)

	CONK! Encyclopedia: DNA_computing (Site not responding. Last check: 2007-10-21)
		But DNA computing does not provide any new capabilities from the standpoint of computational complexity theory, the study of which computational problems are difficult.
		For example, problems which grow exponentially with the size of the problem (EXPSPACE problems) on von Neumann machines still grow exponentially with the size of the problem on DNA machines.
		For very large EXPSPACE problems, the amount of DNA required is too large to be practical.
	www.conk.com /search/encyclopedia.cgi?q=DNA_computing (436 words)

	EXPSPACE -- Facts, Info, and Encyclopedia article (Site not responding. Last check: 2007-10-21)
		In (Click link for more info and facts about complexity theory) complexity theory, EXPSPACE is the set of all (Click link for more info and facts about decision problem) decision problems solvable by a deterministic (A hypothetical computer with an infinitely long memory tape) Turing machine in (The 15th letter of the Roman alphabet) O(2
		A decision problem is in EXPSPACE-complete if it is in EXPSPACE, and every problem in EXPSPACE has a (Click link for more info and facts about polynomial-time many-one reduction) polynomial-time many-one reduction to it.
		If the Kleene star is left out, then that problem becomes (Click link for more info and facts about NEXPTIME) NEXPTIME-complete, which is like (Click link for more info and facts about EXPTIME) EXPTIME-complete, except it is defined in terms of non-deterministic Turing machines rather than deterministic.
	www.absoluteastronomy.com /encyclopedia/E/EX/EXPSPACE7.htm (242 words)

	Restrict (Site not responding. Last check: 2007-10-21)
		If p(n) is a linear function, the resulting class is often called E, and is obviously a subset of EXPTIME.
		EXPTIME is known to be a subset of EXPSPACE and a superset of PSPACE,
		EXPSPACE is a strict superset of EXPTIME, PSPACE, NP-complete, NP, and P. An example o
	bonose.com /Restrict-180.html (893 words)

	On reductions to sets that avoid EXPSPACE (Extended Abstract) (ResearchIndex) (Site not responding. Last check: 2007-10-21)
		Abstract: A set B is called EXPSPACE-avoiding, if every subset of B in EXPSPACE is sparse.
		For example, sets of high information density (called HIGH sets in [5]) are shown to be EXPSPACE-avoiding.
		Investigating the complexity of sets A in EXPSPACE that honestly reduce to EXPSPACE-avoiding sets, we show that if the reducibility used has a property, called range-constructibility, then A must also reduce to a sparse set under the same reducibility.
	citeseer.ist.psu.edu /45325.html (393 words)

	iqexpand.com (Site not responding. Last check: 2007-10-21)
		Look for Expspace in Wiktionary, our sister dictionary project.
		Look for Expspace in the Commons, our repository for free images, music, sound, and video.
		I've shown that every problem in EXPSPACE can be solved by spitting on the sidewalk and analyzing the bubbles in the resultant globule.
	expspace.iqexpand.com (404 words)

	Learn more about EXPSPACE in the online encyclopedia. (Site not responding. Last check: 2007-10-21)
		Learn more about EXPSPACE in the online encyclopedia.
		Enter a phrase or search word in the box below.
		Hint: Play with putting spaces before and after your words to see the different results you get.
	www.onlineencyclopedia.org /e/ex/expspace.html (293 words)

	Diary for harrisj
		Is this also true of EXPTIME problems, or is verification in a higher class, or is it simply unprovable.
		EXPTIME measures execution in time, EXPSPACE measures execution in space.
		It is known that EXPTIME is a subset of EXPSPACE, but not known whether it is proper containment or not (all we know is that P != EXPTIME, right?).
	www.advogato.org /person/harrisj/diary.html?start=31 (2094 words)

	CONCUR 2003: Abstract for Paper 29 (Site not responding. Last check: 2007-10-21)
		We introduce new techniques for encoding Turing machine computations using games with LTL winning conditions, and show that deciding games for the LTL fragment with only the always and eventuality modalities is 2EXPTIME-hard.
		We also prove that for the LTL fragment with only the eventuality modality, along with conjunctions and disjunctions, deciding games is EXPSPACE-hard matching the previously known EXPSPACE upper bound for this fragment.
		On the positive side, we show that if the winning condition is a Boolean combination of formulas of the form "eventually p" and "infinitely often p", for a state-formula p, then the game can be decided in PSPACE, and also establish a matching lower bound.
	www.cmi.univ-mrs.fr /concur03/final/Abstracts/29.html (235 words)

	Computational Complexity: Embarrassing Mistakes
		Using Autoreducibility to Separate Complexity Classes we claimed that all the EXPSPACE complete sets were autoreducible.
		We later realized this result would separate NP from L and discovered the FOCS paper had a bad proof.
		The autoreducibility of EXPSPACE remains open and settling it in either direction would have major complexity consequences.
	weblog.fortnow.com /2005/01/embarrassing-mistakes.html (446 words)

	On reductions to sets that avoid EXPSPACE - Arvind, Kobler, Mundhenk (ResearchIndex) (Site not responding. Last check: 2007-10-21)
		On reductions to sets that avoid EXPSPACE - Arvind, Kobler, Mundhenk (ResearchIndex)
		On reductions to sets that avoid EXPSPACE (1995)
		Sparse sets and sets of high information density (called HIGH sets in [5]) are shown to be EXPSPACE-avoiding.
	citeseer.ist.psu.edu /153044.html (442 words)

	A Logic for Petri Nets and its Applications. (Site not responding. Last check: 2007-10-21)
		The author shows that the satisfiability problem for this logic is EXPSPACE complete.
		Using this logic, a wide range of Petri net problems can be reduced to the satisfiability problem.
		Thus, this logic offers an umbrella under which many Petri net problems can be shown to be solvable in EXPSPACE.
	www.informatik.uni-hamburg.de /TGI/pnbib/h/hsu_chun_yen4.html (118 words)

	CS 341: Theory of Computation, Takehome Final (Site not responding. Last check: 2007-10-21)
		This problem will be graded on correctness, completeness and accessability a 151 audience.
		2) For each of the languages below tell the smallest complexity class (L, NL, P, RP (or co-RP), NP (or co-NP), PSPACE, or EXPSPACE) that the language is known to lie in.
		For example, for the language CLIQUE the answer is NP (it may be in P or L, but we do not know this).
	www.math.grin.edu /~gum/courses/spring-2002/341/hw/final.html (329 words)

	A Unified Approach for Deciding the Existence of Certain Petri Net Paths. (Site not responding. Last check: 2007-10-21)
		We first define a class of formulas for paths in Petri nets.
		We then show that the satisfiability problem for our formulas in EXPSPACE complete.
		Since a wide range of Petri net problems can be reduced to the satisfiablility problem in a straightforward manner, our approach offers an umbrella under which many Petri net problems can be shown to be solvable in EXPSPACE.
	www.informatik.uni-hamburg.de /TGI/pnbib/h/hsu_chun_yen2.html (126 words)

	On the Computational Complexity of Decidable Fragments of First-Order Linear Temporal Logics (Site not responding. Last check: 2007-10-21)
		The packed monodic fragment has the same complexity as its pure first-order part - 2EXPTIME-complete.
		Over any class of flows of time containing one with an infinite ascending sequence - e.g., rationals and real numbers time, and arbitrary strict linear orders - we obtain EXPSPACE lower bounds (which solves an open problem of [16]).
		Our results continue to hold if we restrict to models with finite first-order domains.
	csdl2.computer.org /persagen/DLAbsToc.jsp?resourcePath=/dl/proceedings/&toc=comp/proceedings/time-ictl/2003/1912/00/1912toc.xml&DOI=10.1109/TIME.2003.1214884 (266 words)

Try your search on: Qwika (all wikis)