DSPACE

Known as: Deterministic space, SPACE(f(n)), Multi-string Turing machine with input and output 
In computational complexity theory, DSPACE or SPACE is the computational resource describing the resource of memory space for a deterministic Turing… (More)
Wikipedia

Related topics

Related topics

25 relations
AlgorithmAlgorithmic efficiencyAnalysis of algorithmsComplexity class
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
Institutional Repositories: Evaluating the Reasons for Non-use of Cornell University's Installation of DSpace
Problem: While there has been considerable attention dedicated to the development and implementation of institutional… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Core Vector Machines: Fast SVM Training on Very Large Data Sets
Standard SVM training has O(m3) time andO(m2) space complexities, where m is the training set size. It is thus computationally… (More)
  • figure 1
  • table 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
MUSCLE: a multiple sequence alignment method with reduced time and space complexity
In a previous paper, we introduced MUSCLE, a new program for creating multiple alignments of protein sequences, giving a brief… (More)
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Social Research Methods: Qualitative and Quantitative Approaches
The sociologist, then, is someone concerned with understanding society in a disciplined way. The nature of this discipline is… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The Space Complexity of Approximating the Frequency Moments
 
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Parallel Computer Architecture: A Hardware/Software Approach
enter the circuit several times, possibly via different input processors. More elaborate combinatorial considerations than for… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Genome Sequence Assembly Using Trace Signals and Additional Sequence Information
Proprietary Data Analysis GATC offers a wide range of bioinformatic solutions for genome assembly and alignment, transcriptome… (More)
Is this relevant?
Highly Cited
1995
Highly Cited
1995
A signal processing approach to fair surface design
In this paper we describe a new tool for interactive free-form fair surface design. By generalizing classical discrete Fourier… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
An automata-theoretic approach to branching-time model checking
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
A Filtering Algorithm for Constraints of Difference in CSPs
Many real-life Constraint Satisfaction Problems (CSPs) involve some constraints similar to the alldifferent constraints. These… (More)
Is this relevant?