1055 search results - page 113 / 211 » Enumerations in computable structure theory |
155
click to vote
ICCS
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Previous work of the authors has studied a notion of implication between sets of sequences based on the conceptual structure of a Galois lattice, and also a way of repres...
144
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
125
click to vote
SPAA
2005
ACM
15 years 10 months ago
2005
ACM
This paper shows for the first time that elimination, a scaling technique formerly applied only to counters and LIFO structures, can be applied to FIFO data structures, specific...
139
click to vote
STACS
1994
Springer
15 years 8 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
177
click to vote
EDCC
2008
Springer
15 years 6 months ago
2008
Springer
In avionics domain, the software applications grew to millions of source lines of code representing important development expenditures. To cut the costs, the avionics suppliers ar...