165 search results - page 23 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
112
click to vote
COCO
2008
Springer
15 years 1 months ago
2008
Springer
We introduce a simple game family, called Constraint Logic, where players reverse edges in a directed graph while satisfying vertex in-flow constraints. This game family can be in...
JPDC
2007
14 years 11 months ago
2007
In this paper, we address the problem of multiple sequence alignment (MSA) for handling very large number of proteins sequences on mesh-based multiprocessor architectures. As the ...
117
click to vote
PVLDB
2008
14 years 11 months ago
2008
This paper studies, for the first time, the management of type information for an important class of semi-structured data: nested DAGs (Directed Acyclic Graphs) that describe exec...
104
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
PATAT
1997
Springer
15 years 3 months ago
1997
Springer
In this study we have tackled the NP-hard problem of academic class scheduling (or timetabling) at the university level. We have investigated a variety of approaches based on simu...