Výsledky vyhledávání - "Complexity Measures and Classes—reducibility and completeness"

Assigning Tasks for Efficiency in Hadoop

Autoři: Michael J. Fischer Xueyuan Su Yitong Yin a další

Přispěvatelé: Michael J. Fischer Xueyuan Su Yitong Yin a další

Zdroj: http://www.cs.yale.edu/publications/techreports/tr1423.pdf.

Témata: and concurrency, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—reducibility and completeness, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—sequencing and scheduling General Terms, Algorithms, Performance, The

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.670; http://www.cs.yale.edu/publications/techreports/tr1423.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.670
http://www.cs.yale.edu/publications/techreports/tr1423.pdf

The expressibility of functions on the Boolean domain, with applications to Counting CSPs

Autoři: Andrei A. Bulatov Martin Dyer Leslie Ann Goldberg a další

Přispěvatelé: Andrei A. Bulatov Martin Dyer Leslie Ann Goldberg a další

Zdroj: http://www.cs.sfu.ca/~abulatov/papers/expressibility-acm.pdf.

Témata: Categories and Subject Descriptors, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Reducibility and completeness, Relations among complexity classes, F.2.2 [Analysis of Algo- rithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, F.4.1 [Mathematical Logic and Formal Languages

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.643.278

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.643.278
http://www.cs.sfu.ca/~abulatov/papers/expressibility-acm.pdf

The complexity of the counting constraint satisfaction problem

Autoři: Andrei A. Bulatov The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Andrei A. Bulatov The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.sfu.ca/~abulatov/papers/counting-acm.pdf.

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

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.642.8196

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.642.8196
http://www.cs.sfu.ca/~abulatov/papers/counting-acm.pdf

Complexity of conservative constraint satisfaction problems

Autoři: Andrei A. Bulatov The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Andrei A. Bulatov The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.sfu.ca/~abulatov/papers/conserv-journ.pdf.

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

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.5725

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.406.5725
http://www.cs.sfu.ca/~abulatov/papers/conserv-journ.pdf

A A PSPACE-Complete First Order Fragment of Computability Logic

Autoři: Matthew S. Bauer The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Matthew S. Bauer The Pennsylvania State University CiteSeerX Archives

Zdroj: http://tocl.acm.org/accepted/bauer_pspace.pdf.

Témata: Categories and Subject Descriptors, F.1.3 [Computation by Abstract Devices, Complexity Measures and Classes—Reducibility and Completeness, F.4.1 [Mathematical Logic and Formal Languages, Mathematical Logic—Computability Theory, Computational Logic General Terms, Theory Additional Key Words and Phrases, Computability logic, computational complexity, game semantics, interactive

Popis souboru: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.5211; http://tocl.acm.org/accepted/bauer_pspace.pdf

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.5211
http://tocl.acm.org/accepted/bauer_pspace.pdf

Complexity of conservative Constraint Satisfaction Problems

Autoři: Andrei A. Bulatov The Pennsylvania State University CiteSeerX Archives

Přispěvatelé: Andrei A. Bulatov The Pennsylvania State University CiteSeerX Archives

Zdroj: http://www.cs.sfu.ca/~abulatov/papers/consfull.ps.

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

Dostupnost: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.9544
http://www.cs.sfu.ca/~abulatov/papers/consfull.ps