1055 search results - page 46 / 211 » Enumerations in computable structure theory |
ISSAC
2007
Springer
14 years 4 months ago
2007
Springer
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
SIGECOM
2009
ACM
14 years 4 months ago
2009
ACM
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
IPPS
1999
IEEE
14 years 2 months ago
1999
IEEE
Parallel programming continues to be difficult, despite substantial and ongoing research aimed at making it tractable. Especially dismaying is the gulf between theory and the pract...
MSCS
2008
13 years 10 months ago
2008
Subtyping for inductive types in dependent type theories is studied in the framework of coercive subtyping. General structural subtyping rules for parameterised inductive types ar...
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
We give a complexity theoretic classification of homomorphism problems for graphs and, more generally, relational structures obtained by restricting the left hand side structure ...