579 Hits in 4.2 sec


Jessica Cauchard, Markus Löchtefeld, Mike Fraser, Antonio Krüger, Sriram Subramanian
2012 Proceedings of the 14th international conference on Human-computer interaction with mobile devices and services - MobileHCI '12  
We furthermore prototype pSpaces and m+pSpaces, two spatially-aware systems equipped with pico-projectors as auxiliary displays to provide dual-display capability to the handheld device.  ...  In a first study, we compare our spatially-aware prototype (mSpaces) to existing context switching methods for navigating amongst multiple tasks in the mobile environment.  ...  INTRODUCTION The use of multiple workspaces is common in desktop computing and integrated into most Operating Systems (OS).  ... 
doi:10.1145/2371574.2371601 dblp:conf/mhci/CauchardLFKS12 fatcat:cg6j6onjwjdbrigpi2vrd7unzq

Page 2806 of Mathematical Reviews Vol. , Issue 91E [page]

1991 Mathematical Reviews  
An important measure of efficiency for these protocols is the number of rounds in the interaction.  ...  Because for f € #PSPACE, the length of f(x) can be exponential in |x|, a natural restriction of this class is considered: A function f is in )PSPACE if and only if there is a nondeterministic Tur- ing  ... 

Beyond NP

Lance Fortnow
2005 Proceedings of the thirty-seventh annual ACM symposium on Theory of computing - STOC '05  
Frederic Pohl, Beyond the Blue Event Horizon [45] ABSTRACT Shortly after Steven Cook and Richard Karp showed the existence of many natural NP-complete languages, researchers started to realize the great  ...  Larry Stockmeyer discovered an amazing structure of complexity classes that continues to direct the research in complexity to this day.  ...  Complexity theorists use the models, theorems and techniques to help understand everything from circuit complexity to interactive proof systems.  ... 
doi:10.1145/1060590.1060609 dblp:conf/stoc/Fortnow05 fatcat:5ikpf2sn4bhkbpodkx3lzh4cdq

Equilibrium Value Method for the Proof of QIP=PSPACE [article]

Xiaodi Wu
2011 arXiv   pre-print
Unlike solving some semidefinite programs that captures the computational power of quantum interactive proofs, our method starts with one QIP-Complete problem which computes the diamond norm between two  ...  The multiplicative weight update method is also applied to solve the equilibrium value problem, however, in a relatively simpler way than the one in the original proof.  ...  Acknowledgments The author is grateful to Zhengfeng Ji, Yaoyun Shi and John Watrous for helpful discussions.  ... 
arXiv:1004.0264v4 fatcat:ouithffdrrciflvhmu4taho6y4

Toward a General Complexity Theory of Motion Planning: Characterizing Which Gadgets Make Games Hard

Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch, Michael Wagner
2020 Innovations in Theoretical Computer Science  
NP-complete), unbounded 1-player motion planning (NL vs. PSPACE-complete), and bounded 2-player motion planning (P vs.  ...  PSPACE-complete), and we partially characterize the complexity of unbounded 2-player motion planning (P vs. EXPTIME-complete), bounded 2-team motion planning (P vs.  ...  Of course, we also hope that this framework will enable the solution of many open problems in this space.  ... 
doi:10.4230/lipics.itcs.2020.62 dblp:conf/innovations/DemaineHL20 fatcat:g2itt6y3jrafnazpukr3nboz2m

Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games

Baris Aydinlioglu, Dieter van Melkebeek
2012 2012 IEEE 27th Conference on Computational Complexity  
The following are two instantiations that may be of independent interest: Assuming that Arthur-Merlin games can be derandomized in Σ2P, we show that (i) PSPACE ⊆ NP/poly implies PSPACE ⊆ Σ2P, and (ii)  ...  A key ingredient in our proofs is improved Karp-Lipton style collapse results for nondeterministic circuits.  ...  The proof hinges on the existence of an interactive proof system for L in which the honest prover's responses are computable in PSPACE.  ... 
doi:10.1109/ccc.2012.32 dblp:conf/coco/AydinliogluM12 fatcat:b4dgncxwyrhgrmziowvmkssihm

A General Theory of Motion Planning Complexity: Characterizing Which Gadgets Make Games Hard [article]

Erik D. Demaine, Dylan H. Hendrickson, Jayson Lynch
2018 arXiv   pre-print
NP-complete), unbounded 1-player motion planning (NL vs. PSPACE-complete), and bounded 2-player motion planning (P vs.  ...  PSPACE-complete), and we partially characterize the complexity of unbounded 2-player motion planning (P vs. EXPTIME-complete), bounded 2-team motion planning (P vs.  ...  Theorem 2.6. 1-player motion planning with the locking 2-toggle is PSPACE-complete. Proof. The gadget is in PSPACE by Lemma 2.1.  ... 
arXiv:1812.03592v1 fatcat:iq6uhuuvbzcotkjk4s7dhicg7m

Simulating quadratic dynamical systems is PSPACE-complete (preliminary version)

Sanjeev Arora, Yuval Rabani, Umesh Vazirani
1994 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94  
We show, however, that the following sampling problem for QDS's is PSPACE-hard: Given an initial distribution, produce a random sample from the t'th generation.  ...  Such systems also play a role in genetic algorithms, a widelyused class of heuristics that are notoriously hard to analyze.  ...  We do not know whether the same is true for the PSPACE-hard system given later.  ... 
doi:10.1145/195058.195231 dblp:conf/stoc/AroraRV94 fatcat:e467gv4zbncydkoskx6lm77x6u

Dynamic Observers for the Synthesis of Opaque Systems [chapter]

Franck Cassez, Jérémy Dubreil, Hervé Marchand
2009 Lecture Notes in Computer Science  
In this context, we show that checking whether a system is opaque and computing an optimal static observer ensuring opacity are both PSPACE-complete problems.  ...  Our main result is that the synthesis problem can be solved in EXPTIME.  ...  (B) is also in PSPACE. To see it is PSPACE-complete, to check whether F is opaque w.r.t. (G, Σ), it suffices to solve Problem 2.(B) and then check whether n 0 = |Σ|.  ... 
doi:10.1007/978-3-642-04761-9_26 fatcat:os7ibu3vkrdrlgn4eb3fmk4dga

Emergence Made Ontological? Computational versus Combinatorial Approaches

Philippe Huneman
2008 Philosophy of Science  
I challenge the usual approach of defining emergence in terms of properties of wholes "emerging" upon properties of parts.  ...  (1992) show that if the global rule is non-constant free, then the problem of predicting the state of the system at time T is PSPACE complete; hence the problem cannot be solved in polynomial time (  ...  As the authors write: "If the prediction problem is PSPACE complete, this would mean essentially that the system is not easily predictable, and that there seems to be no better prediction method other  ... 
doi:10.1086/596777 fatcat:oei4bjpomfgghd3sd66icwfalu

Page 7076 of Mathematical Reviews Vol. , Issue 92m [page]

1992 Mathematical Reviews  
Summary: “We present a new algebraic technique for the construc- tion of interactive proof systems.  ...  This technique played a pivotal role in the recent proofs that IP = PSPACE (Shamir) and that MIP = NEXP (Babai, Fortnow and Lund).”  ... 

Interactive Proofs for Synthesizing Quantum States and Unitaries [article]

Gregory Rosenthal, Henry Yuen
2021 arXiv   pre-print
Our main result is a "state synthesis" analogue of the inclusion 𝖯𝖲𝖯𝖠𝖢𝖤⊆𝖨𝖯: any sequence of states computable by a polynomial-space quantum algorithm (which may run for exponential time) admits  ...  We obtain analogous results in the setting with multiple entangled provers as well.  ...  Therefore f is well defined, and since L is in PSPACE clearly f is computable in PSPACE as well. Finally, consider n, x, r with |p n (x) − r| ≥ 2 • 2 −m(n) .  ... 
arXiv:2108.07192v2 fatcat:wsxc4btftfebfajunooabcptom

Deciding Hyperproperties [article]

Bernd Finkbeiner, Christopher Hahn
2016 arXiv   pre-print
We show that the problem is PSPACE-complete for alternation-free formulas (and, hence, no more expensive than LTL satisfiability), EXPSPACE-complete for exists-forall-formulas, and undecidable for forall-exists-formulas  ...  In this paper, we study the satisfiability problem of HyperLTL.  ...  This construction is sound, because ∃ * ∀ * ∃ * ∀ * bounded ∃ * ∀ * ∀∃ PSPACE- complete PSPACE- complete EXPSPACE- complete PSPACE- complete undecidable in an alternation-free formula, the values for  ... 
arXiv:1606.07047v1 fatcat:ki7zjsh6kfhxnlj2nwnd65uwb4


Dylan Coyle
2016 Figshare  
Neither 1936 cell-based Turing machine nor PSPACE can be deterministic because they have variable metrics.  ...  Basically, in proving P =\= NP, we defined axioms and qualities for agent based maths and physics that are shared and progressive.  ...  And (2) everything does not mean complete, everything being all the identities. (3) Complete does not mean complete. In an inconsistent frozen theory, this is appropriate.  ... 
doi:10.6084/m9.figshare.4265192.v1 fatcat:6zfz2bq6drgpbjpsxzractnpru

Page 7014 of Mathematical Reviews Vol. , Issue 89M [page]

1989 Mathematical Reviews  
However, when a more succinct representation of the inputs is allowed, the problems become either EXPTIME- or PSPACE- complete.  ...  This may be viewed as a first step to a general theory of cooperative communication in distributed systems. An honest message is one that is known to be true when it is sent (or said).  ... 
« Previous Showing results 1 — 15 out of 579 results