Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,035,436 papers from all fields of science
Search
Sign In
Create Free Account
St-connectivity
Known as:
STCON
, ST Connectivity
, STConnectivity
Expand
In computer science and computational complexity theory, st-connectivity or STCON is a decision problem asking, for vertices s and t in a directed…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Computational complexity theory
Computer science
Decision problem
Directed graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Enhancing PDR / IC 3 with Localization Abstraction
Yen-Sheng Ho
,
A. Mishchenko
,
R. Brayton
,
N. Eén
2017
Corpus ID: 43186304
Property Directed Reachability (aka PDR/IC3) is the strongest engine presently used in formal verification tools. Localization…
Expand
2017
2017
A simple FPRAS for bi-directed reachability
Heng Guo
,
M. Jerrum
arXiv.org
2017
Corpus ID: 3308946
Gorodezky and Pak (Random Struct. Algorithms, 2014) introduced a "cluster-popping" algorithm for sampling root-connected…
Expand
2016
2016
Control-flow guided clause generation for property directed reachability
Xian Li
,
K. Schneider
High Level Design Validation and Test Workshop
2016
Corpus ID: 6303303
Property directed reachability (PDR) has been introduced as a very efficient verification method for synchronous hardware…
Expand
2015
2015
Does self-employed work make individuals not only more entrepreneurial but also more narcissistic and antisocial? A 15-year longitudinal personality-based analysis
M. Obschonka
,
F. Lievens
,
B. Wille
,
F. Fruyt
2015
Corpus ID: 54529914
The potential socialization effects of entrepreneurial work are largely underresearched. In this longitudinal study, we quantify…
Expand
2015
2015
Property-directed synthesis of reactive systems from safety specifications
T. Chiang
,
J. H. Jiang
IEEE/ACM International Conference on Computer…
2015
Corpus ID: 8568046
Reactive system synthesis from safety specifications is a promising approach to the correct-by-construction methodology. The…
Expand
2015
2015
Diagnosing Unreachable States Using Property Directed Reachability
Ryan Berryhill
,
A. Veneris
2015
Corpus ID: 7639459
In the modern design cycle, substantial manual effort is required to correct errors found when verification reveals an…
Expand
2014
2014
New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs
Diptarka Chakraborty
,
A. Pavan
,
Raghunath Tewari
,
N. V. Vinodchandran
,
Lin F. Yang
Foundations of Software Technology and…
2014
Corpus ID: 2617248
We obtain the following new simultaneous time-space upper bounds for the directed reachability problem. (1) A polynomial-time, O…
Expand
2014
2014
Dynamic Complexity of Directed Reachability and Other Problems
Samir Datta
,
W. Hesse
,
R. Kulkarni
International Colloquium on Automata, Languages…
2014
Corpus ID: 42680182
We report progress on dynamic complexity of well-known graph problems such as reachability and matching. In this model, edges are…
Expand
1998
1998
Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-Like Cutting Planes
Jan Johannsen
Information Processing Letters
1998
Corpus ID: 14023210
1992
1992
Time-space tradeoffs for graph S-T connectivity
G. Barnes
1992
Corpus ID: 124336998
The problem of graph s-t connectivity, determining whether two vertices s and t in a graph are in the same connected component…
Expand
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)
ACCEPT & CONTINUE
or Only Accept Required