Suchergebnisse - f.2.2[analysis of algorithms and problems complexity]

Precise Complexity Analysis for Efficient Datalog Queries

Autoren: K. Tuncay Tekle Yanhong A. Liu The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: K. Tuncay Tekle Yanhong A. Liu The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.cs.sunysb.edu/%7Eliu/papers/RuleQuery-PPDP10.pdf.

Schlagwörter: F.2.2 [Analysis of Algorithms and Problems Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures, H.2.3 [Information Systems, Database Management— Query languages, H.2.4 [Information Systems, Systems—Query processing, Rule-based databases General Terms Languages, Performance Keywords Complexity analysis, Datalog, demand-driven evaluation, program transformation

Dateibeschreibung: application/pdf

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

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.183.4887
http://www.cs.sunysb.edu/%7Eliu/papers/RuleQuery-PPDP10.pdf

Convergence Time to Nash Equilibrium in Load Balancing

Autoren: Eyal Even-Dar Alex Kesselman , Yishay Mansour The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Eyal Even-Dar Alex Kesselman , Yishay Mansour The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.seas.upenn.edu/~evendar/papers/convergence.pdf.

Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problems Complexity, Nonnumerical Algorithms and Problems General Terms, Algorithms, Theory, Game Theory Additional Key Words and Phrases, Nash Equilibrium

Dateibeschreibung: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.5090; http://www.seas.upenn.edu/~evendar/papers/convergence.pdf

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.5090
http://www.seas.upenn.edu/~evendar/papers/convergence.pdf

Eigenvalues and Expansion of Regular Graphs

Autoren: Nabil Kahale The Pennsylvania State University CiteSeerX Archives

Weitere Verfasser: Nabil Kahale The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.research.att.com/~kahale/papers/jacm.ps.

Schlagwörter: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problems Complexity, Nonnumerical Algorithms and Problems, G.2.2 [Discrete Mathematics, Graph Theory General Terms, Algorithms, Theory Additional Key Words and Phrases, Eigenvalues, Expander graphs, Induced subgraphs, Load balancing, Ramanujan graphs, Random walks, Selection networks

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7886; http://www.research.att.com/~kahale/papers/jacm.ps

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.7886
http://www.research.att.com/~kahale/papers/jacm.ps

Polynomial-Time Data Reduction for DOMINATING SET.

Autoren: Alber, Jochen Fellows, Michael R. Niedermeier, Rolf

Quelle: Journal of the ACM; May2004, Vol. 51 Issue 3, p363-384, 22p

Schlagwörter: NP-complete problems, COMPUTATIONAL complexity, GRAPH theory, DATA reduction, TOPOLOGY, COMBINATORIAL optimization, MATHEMATICAL optimization

On Hard Instances of Approximate Vertex Cover.

Autoren: Vishwanathan, Sundar

Quelle: ACM Transactions on Algorithms; 2008, Vol. 5 Issue 1, p7-7:6, 6p

Schlagwörter: VERTEX operator algebras, OPERATOR theory, FUNCTIONAL analysis, APPROXIMATION theory, MATHEMATICAL functions, ALGORITHMS

Average-Case Lower Bounds for the Plurality Problem.

Autoren: ALONSO, LAURENT REINGOLD, EDWARD M.

Quelle: ACM Transactions on Algorithms; 2008, Vol. 4 Issue 3, p27-27:17, 17p, 1 Diagram, 4 Charts

Schlagwörter: ALGORITHMS, SET theory, MATHEMATICAL analysis, NUMERICAL analysis, PROBLEM solving, THEORY