127 search results - page 16 / 26 » Computational Complexity of Some Problems Involving Congruen... |
112
click to vote
ERSHOV
2009
Springer
15 years 1 months ago
2009
Springer
A term t is called a template of terms t1 and t2 iff t1 = t1 and t2 = t2, for some substitutions 1 and 2. A template t of t1 and t2 is called the most specific iff for any template...
100
Voted
DAC
1994
ACM
15 years 1 months ago
1994
ACM
Current asynchronous tools are focussed mainly on the design of a single interface module. In many applications, one must design interacting interface modules that potentially comm...
ICCS
1998
Springer
15 years 1 months ago
1998
Springer
Internet-based information technologies have considerable potential for improving collaboration in professional communities. In this paper, we explain the concept of user-driven sp...
APAL
2010
14 years 9 months ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...
ESCIENCE
2007
IEEE
15 years 1 months ago
2007
IEEE
Scientific workflows have recently emerged as a new paradigm for representing and managing complex distributed scientific computations and data analysis, and have enabled and acce...