Skip to search formSkip to main contentSkip to account menu

Configuration graph

Configuration graphs are a theoretical tool used in computational complexity theory to prove a relation between graph reachability and complexity… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We investigate an algebraic problem related to the determination of the fundamental group of a class of spaces of configurations… 
2012
2012
We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played… 
2012
2012
This document describes the pysynphot/Synphot throughput tables, provides with a detailed mapping of these les to the HST… 
2009
2009
Advanced digital signal processing systems require specialized high-performance embedded computer architectures. The term high… 
2008
2008
The programming complexity of increasingly parallel processors calls for new tools that assist programmers in utilising the… 
2007
2007
Service-oriented computing (SOC) emerging as a new computing diagram that supports the rapid and low-cost development of… 
2006
2006
AbstractAn important characteristic of distributed grids is that they allow geographically separated multicomputers to be tied… 
2006
2006
New developments and decreasing costs of electronic appliances enable the realization of pervasive systems in our daily… 
2000
2000
The concept of end is a classical mean of understanding the behavior of a graph at infinity. In this respect, we show that the… 
1996
1996
Most ’interesting’ configuration problems tend to be large-scale. Therefore, the configuration networks grow to remarkable sizes…