15852 articles – 31988 references  [version française]
.:. Browse > List by subject > Computational Complexity .:.
86 documents ordered by :
1 - 2 - 3 - 4 - 5 - 6 - 7 ... Next Last
Datalog and Constraint Satisfaction with Infinite Templates
Bodirsky M., Dalmau V.
Journal on Computer and System Sciences 79 (2013) 79-100 [hal-00756928 - version 1]
fulltext accessible on an other server The Quantum Adiabatic Algorithm applied to random optimization problems: the quantum spin glass perspective
Bapst V., Foini L., Krzakala F., Semerjian G., Zamponi F.
[hal-00738108 - version 1] (03/10/2012)
fulltext accessible on an other server On the Scope of the Universal-Algebraic Approach to Constraint Satisfaction
Martin B., Bodirsky M., Hils M.
[hal-00756930 - version 1] (24/11/2012)
fulltext accessible on an other server Tractable Set Constraints
Bodirsky M., Hils M.
[hal-00757439 - version 1] (26/11/2012)
Monadic Datalog Containment
Benedikt M., Bourhis P., Senellart P.
In ICALP (International Colloquium on Automata, Languages, and Programming) - ICALP (International Colloquium on Automata, Languages, and Programming), United Kingdom (2012) [hal-00737942 - version 1]
fulltext access Hardness of longest common subsequence for sequences with bounded run-lengths
Blin G., Bulteau L., Jiang M., Pedro J. T., Vialette S.
In 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12) - 23rd Annual Symposium on Combinatorial Pattern Matching (CPM'12), Finland (2012) [hal-00683311 - version 1]
fulltext accessible on an other server Datalog and Constraint Satisfaction with Infinite Templates
Bodirsky M., Dalmau V.
[hal-00757438 - version 1] (26/11/2012)
fulltext accessible on an other server Topological Birkhoff
Bodirsky M., Pinsker M.
[hal-00756921 - version 1] (24/11/2012)
fulltext access Distribution of the number of accessible states in a random deterministic automaton
Carayol A., Nicaud C.
In Symposium on Theoretical Aspects of Computer Science - STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), France (2012) [hal-00678213 - version 1]
fulltext access Asymptotic enumeration of Minimal Automata
Bassino F., David J., Sportiello A.
In Symposium on Theoretical Aspects of Computer Science - STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), France (2012) [hal-00678203 - version 1]