Suchergebnisse - "Nonnumerical Algorithms and Problems— Complexity of proof procedures General Terms Algorithms"

  • Treffer 1 - 5 von 5
Treffer weiter einschränken
  1. 1

    Satisfiability algorithms for conjunctive queries over trees

    Autoren: James Cheney The Pennsylvania State University CiteSeerX Archives

    Weitere Verfasser: James Cheney The Pennsylvania State University CiteSeerX Archives

    Quelle: http://www.edbt.org/Proceedings/2011-Uppsala/papers/icdt/a15-cheney.pdf.

    Schlagwörter: Categories and Subject Descriptors H.2.3 [Database management systems, Languages— query languages, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems— Complexity of proof procedures General Terms Algorithms, Theory Keywords XPath, trees, satisfiability

    Dateibeschreibung: application/pdf

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

    Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.3064
    http://www.edbt.org/Proceedings/2011-Uppsala/papers/icdt/a15-cheney.pdf

    View record from BASE Nájsť tento článok vo Web of Science
    Zu den Favoriten
  2. 2

    Are Short Proofs Narrow? QBF Resolution Is Not So Simple.

    Autoren: BEYERSDORFF, OLAF CHEW, LEROY MAHAJAN, MEENA et al.

    Quelle: ACM Transactions on Computational Logic; Jan2018, Vol. 19 Issue 1, p1-26, 26p

    Schlagwörter: EVIDENCE, BOOLEAN functions, CALCULI

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  3. 3

    Are Short Proofs Narrow? QBF Resolution Is Not So Simple.

    Autoren: BEYERSDORFF, OLAF CHEW, LEROY MAHAJAN, MEENA et al.

    Quelle: ACM Transactions on Computational Logic; Dec2017, Vol. 18 Issue 4, p1-26, 26p

    Schlagwörter: BOOLEAN functions, CALCULI, SIMULATION methods & models, MATHEMATICAL analysis, COMPUTATIONAL complexity

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  4. 4

    Parameterized Complexity of DPLL Search Procedures.

    Autoren: BEYERSDORFF, OLAF GALESI, NICOLA LAURIA, MASSIMO

    Quelle: ACM Transactions on Computational Logic; Aug2013, Vol. 14 Issue 3, p1-21, 21p

    Schlagwörter: COMPUTATIONAL complexity, PARAMETER estimation, PERFORMANCE evaluation, ALGORITHMS, GRAPH theory, MATHEMATICAL formulas, MATHEMATICAL bounds

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten
  5. 5

    PSPACE Bounds for Rank-1 Modal Logics.

    Autoren: Schröder, Lutz Pattinson, Dirk

    Quelle: ACM Transactions on Computational Logic; Feb2009, Vol. 10 Issue 2, p13-13.33, 33p, 2 Diagrams

    Schlagwörter: ALGORITHMS, TECHNOLOGICAL complexity, COMPUTATIONAL complexity, PROGRAMMING languages, MATHEMATICAL logic

    Full Text Finder Nájsť tento článok vo Web of Science
    Zu den Favoriten

Suchwerkzeuge: