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.
2018
2018
Learning to Serve: An Experimental Study for a New Learning From Demonstrations Framework
Learning from demonstrations is an easy and intuitive way to show examples of successful behavior to a robot. However, the fact… 
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… 
2008
2008
Validation of the Submetric Accuracy of Vertical Positioning of PSs in C-Band
The permanent scatterers (PSs) technique is an operational tool in the context of spaceborne synthetic aperture radar… 
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… 
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… 
Review
1999
Review
1999
Calibration of an outdoor active camera system
A parametric camera model and calibration procedures are developed for an outdoor active camera system with pan, tilt and zoom… 
1992
1992
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
In this paper we study the consequences of the existence of sparse hard sets for NP and other complexity classes under certain… 
Highly Cited
1991
Highly Cited
1991
On reductions of NP sets to sparse sets
M. Ogiwara and O. Watanabe (1990) showed that if SAT is bounded truth-table reducible to a sparse set, then P=NP. In the present… 
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)