9842 search results - page 380 / 1969 » The Complexity of the Matching-Cut Problem |
145
click to vote
CSL
2006
Springer
15 years 4 months ago
2006
Springer
Model-checking problems for PDL (propositional dynamic logic) and its extension PDL (which includes the intersection operator on programs) over various classes of infinite state sy...
135
click to vote
SIAMCOMP
2008
15 years 4 months ago
2008
![Resolution Is Not Automatizable Unless W[P] Is Tractable](https://sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Resolution Is Not Automatizable Unless W[P] Is Tractable")
We show that neither Resolution nor tree-like Resolution is automatizable unless the class W[P] from the hierarchy of parameterized problems is fixed-parameter tractable by randomi...
121
click to vote
IPL
2007
15 years 4 months ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
140
Voted
IJON
2002
15 years 4 months ago
2002
For a network of spiking neurons that encodes information in the timing of individual spike times, we derive a supervised learning rule, SpikeProp, akin to traditional errorbackpr...
167
click to vote
PROPERTYTESTING
2010
15 years 2 months ago
2010
We initiate the study of sublinear-time algorithms in the external memory model [Vit01]. In this model, the data is stored in blocks of a certain size B, and the algorithm is char...