1071 search results - page 97 / 215 » Theories of Automatic Structures and Their Complexity |
BIRTHDAY
2010
Springer
13 years 9 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
SEMWEB
2007
Springer
14 years 2 months ago
2007
Springer
Ontology mapping is to find semantic correspondences between similar elements of different ontologies. It is critical to achieve semantic interoperability in the WWW. This paper su...
GLVLSI
2002
IEEE
14 years 1 months ago
2002
IEEE
Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coeffici...
MPC
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
LICS
1999
IEEE
14 years 15 days ago
1999
IEEE
Syntax and Variable Binding d Abstract) Marcelo Fiore COGS Univ. of Sussex Gordon Plotkin LFCS Univ. of Edinburgh Daniele Turi LFCS Univ. of Edinburgh op a theory of abstract synt...