Výsledky vyhledávání - "Complexity Measures and Classes—Reducibility and completeness General Terms"
-
1
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic— Logic and constraint programming, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Reducibility and completeness General Terms, Algorithms, Theory Additional Key Words and Phrases, Constraint Satisfaction problem, counting problems, com- plexity
Popis souboru: application/pdf
-
2
Autoři:
Přispěvatelé:
Témata: Mathematical Logic—Logic and constraint programming, G.2.1 [Discrete Mathematics, Combinatorics—Combinatorial algorithms, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Reducibility and completeness General Terms, Algorithms, Theory Additional Key Words and Phrases, complexity, Constraint Satisfaction Problem, dichotomy theorem, homomorphism
Popis souboru: application/pdf
-
3
Autoři:
Přispěvatelé:
Témata: Categories and Subject Descriptors, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic--Logic and constraint programming, G.2.1 [Discrete Mathematics, Combinatorics--Combinatorial algorithms, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes--Reducibility and completeness General Terms, Algorithms, Theory Additional Key Words and Phrases, Constraint Satisfaction problem, homomorphism problem, complexity, dichotomy theorem
Popis souboru: application/postscript
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.9544; http://www.cs.sfu.ca/~abulatov/papers/consfull.ps
Nájsť tento článok vo Web of Science