13306 search results - page 393 / 2662 » Theoretical Computer Science |
168
click to vote
SPIN
1999
Springer
15 years 11 months ago
1999
Springer
One of the difficulties of using model checkers “in the large” is the management of all (generated) data during the validation trajectory. It is important that the results obta...
169
click to vote
FOCS
1996
IEEE
15 years 11 months ago
1996
IEEE
In the minimum path coloring problem, we are given a list of pairs of vertices of a graph. We are asked to connect each pair by a colored path. Paths of the same color must be edg...
166
click to vote
FOCS
1990
IEEE
15 years 11 months ago
1990
IEEE
In [Sh92], Adi Shamir proved a complete characterization of the complexity class IP. He showed that when both randomization and interaction are allowed, the proofs that can be ver...
193
click to vote
SIGBDP
1990
15 years 11 months ago
1990
Technique for Inducing Abstractions", Communications of the ACM, 21(5), 401411, May 1978. [7] Hayes-Roth, Frederick, "Rule-Based Systems", Communications of the ACM,...
163
click to vote
MFCS
2009
Springer
16 years 1 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...