494 search results - page 48 / 99 » Polynomial Equivalence Problems: Algorithmic and Theoretical... |
SOFSEM
2004
Springer
14 years 1 months ago
2004
Springer
We initiate a systematic study of the Row Deletion(B) problem on matrices: For a fixed “forbidden submatrix” B, the question is, given an input matrix A (both A and B have ent...
CP
2004
Springer
14 years 1 months ago
2004
Springer
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
ECAI
1994
Springer
13 years 12 months ago
1994
Springer
We describe a detailed experimental investigation of the phase transition for several different classes of randomly generated satisfiability problems. We observe a remarkable consi...
CONCUR
2009
Springer
14 years 2 months ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
ICALP
2009
Springer
14 years 8 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...