Skip to search formSkip to main contentSkip to account menu

Sparse language

Known as: Sparse (disambiguation), Sparse set 
In computational complexity theory, a sparse language is a formal language (a set of strings) such that the complexity function, counting the number… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
Berman–Hartmanis conjectureCo-NP-completeComplexity classComplexity function

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
An Efficient 3-D Ear Recognition System Employing Local and Holistic Features
We present a complete three-dimensional (3-D) ear recognition system combining local and holistic features in a computationally… 
2009
2009
HYPR-spectral photoacoustic CT for preclinical imaging
We have designed and built a prototype PCT (photoacoustic CT) scanner suitable for small animal imaging that acquires a sparse… 
2008
2008
Harmonic Deformation Model for Edge Based Template Matching
The paper presents an approach to the detection of deformable objects in single images. To this end we propose a robust match… 
2008
2008
Simple Model of Flickermeter Signal Chain for Deformed Modulating Signals
The flickermeter is an instrument designed to measure an obnoxiousness of a flicker. A flickermeter's signal chain is a mapping… 
Highly Cited
2002
Highly Cited
2002
Object Recognition by a Cascade of Edge Probes
We frame the problem of object recognition from edge cues in terms of determining whether individual edge pixels belong to the… 
1996
1996
Automatic Selection of Reference Views for Image-Based Scene Representations
The problem addressed in this paper is related to displaying a real 3-D scene from any viewpoint. To display a scene, a… 
1996
1996
On the Existence of Hard Sparse Sets under Weak Reductions
Recently a 1978 conjecture by Hartmanis was resolved by Cai and Sivakumar, following progress made by Ogihara. It was shown that… 
Highly Cited
1988
Highly Cited
1988
On Sets Truth-Table Reducible to Sparse Sets
We study sets that are truth-table reducible to sparse sets in polynomial time. The principal results are as follows: (1) For… 
1987
1987
A Parallel Computation Algorithm for Static State Estimation by Means of Matrix Inversion Lemma
This paper presents an effective parallel computation algorithm for the static state estimation of a power system. The proposed… 
Highly Cited
1983
Highly Cited
1983
On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets
  • Y. Yesha
  • SIAM journal on computing (Print)
  • 1983
  • Corpus ID: 36893080
Let $\Sigma $ be a finite alphabet. A set $S \subset \Sigma ^ * $ is called sparse if the number of members of S having length at… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)