Tag: space-bounded


Found 47 results for 'space-bounded'.


1) cc.complexity-theory - Logspace algorithms on graphs with bounded tree width
2) cc.complexity-theory - Treewidth and the NL vs L Problem
3) cc.complexity-theory - Super-logspace mapping reducibility
4) cc.complexity-theory - Quantum analogues of SPACE complexity classes
5) cc.complexity-theory - Are non-deterministic tree-walking automata stronger than deterministic ones?
6) cc.complexity-theory - Fooling arbitrary symmetric functions
7) cc.complexity-theory - SC^2 algorithms for st-connectivity
8) cc.complexity-theory - Separating Logspace from Polynomial time
9) cc.complexity-theory - Best current space lower bound for SAT?
10) cc.complexity-theory - Complexity class of efficient streaming algorithms
11) space-bounded - Can $\{a^nb^n\}$ be recognized in poly-time probabilistic sublogarithmic-space?
12) cc.complexity-theory - Why do we consider log-space as a model of efficient computation (instead of polylog-space) ?
13) cc.complexity-theory - Question on deduction that a certain problem requires exponential space
14) cc.complexity-theory - Can multipebble automata decide all deterministic context-sensitive languages?
15) cc.complexity-theory - What are the different notions of one-way functions?
16) cc.complexity-theory - Context-sensitive grammar for SAT?
17) cc.complexity-theory - Time Hierarchies in DSPACE(O(s(n)))
18) cc.complexity-theory - Is the Balanced Boolean Formula problem solvable in sublogarithmic space if the input has a tree structure?
19) cc.complexity-theory - Is the Balanced Boolean Formula problem solvable in sublogarithmic space if the input has a tree structure?
20) cc.complexity-theory - Quadratic relationship between nondeterministic and deterministic space?
21) turing-machines - Why NL is not L
22) cc.complexity-theory - Space alternating hierarchy
23) automata-theory - Do bounded-visit nondeterministic linear bounded automata recognize only regular languages?
24) cc.complexity-theory - Can Quarter-Subset Membership be decided space-efficiently?
25) cc.complexity-theory - Machine characterization of $SAC^i$
26) ds.algorithms - Does There exist a particular PSPACE Complete Problem which has a FPTAS algorithm?
27) ds.algorithms - Does There exist a particular PSPACE Complete Problem which has a FPTAS algorithm?
28) ds.algorithms - Minimal encoding of a set (unordered collection of elements)?
29) cc.complexity-theory - If P = BQP, does this imply that PSPACE (= IP) = AM?
30) cc.complexity-theory - compressing rarely used space
31) np-hardness - Completeness and Context-Sensitive Languages.
32) automata-theory - Alternative to LBA for recognising context-sensitive languages
33) sat - Satisfiability for various branching programs
34) cc.complexity-theory - space-bounded TMs and oracles
35) cc.complexity-theory - Alternate proofs of Immerman-Szelepcsenyi theorem
36) ds.data-structures - Storing a bit vector in uninitialized memory and minimal space
37) cc.complexity-theory - Tight Lower bounds on Savitch's theorem
38) ds.algorithms - Base extension in residue number systems with low space
39) cc.complexity-theory - Time Hierarchies in DSPACE(O(s(n)))
40) ds.algorithms - Storage requirements for median selection (two passes algorithms)
41) cc.complexity-theory - Does Nisan's pseudo-random generator relativize?
42) fl.formal-languages - Example of an context-sensitive language with a specific number of words of length $n$
43) cc.complexity-theory - Is #P contained in PSPACE?
44) cc.complexity-theory - Does the space hierarchy theorem generalize to non-uniform computation?
45) ds.algorithms - CFG parsing using $o(n^2)$ space
46) cc.complexity-theory - Why do we consider log-space as a model of efficient computation (instead of polylog-space) ?
47) cc.complexity-theory - Can every distribution producible by a probabilistic PSpace machine be produced by a PSpace machine with only polynomially many random bits?