/home/csoliver/OKplatform/OKsystem/Annotations/plans/DataAnalysis_MGOK1.hpp [code] | General plans regarding the first article of MG and OK on logical data analysis |
/home/csoliver/OKplatform/OKsystem/Annotations/plans/general.hpp [code] | General plans regarding articles and reports |
/home/csoliver/OKplatform/OKsystem/Annotations/plans/MGDissertation.hpp [code] | Plans regarding the joint report of MG+OK from MG's BSc dissertation |
/home/csoliver/OKplatform/OKsystem/Annotations/plans/MGPhDThesis.hpp [code] | Plans regarding the MG's PhD Thesis |
/home/csoliver/OKplatform/OKsystem/Annotations/plans/MGThesis.hpp [code] | Plans regarding the MG's MRes Thesis and further corrections |
/home/csoliver/OKplatform/OKsystem/Annotations/plans/MGWorkflow.hpp [code] | Basic overview of day to day plans and workflow of MG |
/home/csoliver/OKplatform/OKsystem/Annotations/plans/milestones.hpp [code] | |
/home/csoliver/OKplatform/OKsystem/Annotations/plans/MLDissertation.hpp [code] | Plans regarding the PhD-dissertation of ML |
/home/csoliver/OKplatform/OKsystem/Annotations/plans/OK_RamseyTheory_2vdWshort.hpp [code] | Plans for the short article on 2-coloured vdW-like numbers |
/home/csoliver/OKplatform/OKsystem/Annotations/plans/OK_XSZ_min_degree.hpp [code] | Plans on the joint articles of XSZ and OK |
/home/csoliver/OKplatform/OKsystem/Annotations/plans/Reviews.hpp [code] | |
/home/csoliver/OKplatform/OKsystem/Annotations/plans/RunningReportMG.hpp [code] | Plans regarding the running report (including the MRes dissertation) of MG |
/home/csoliver/OKplatform/OKsystem/Annotations/plans/RunningReportML.hpp [code] | Plans regarding the running report of ML |
Applications/AlgebraicStructures/plans/general.hpp [code] | General plans for the module on searching algebraic structures |
Applications/AlgebraicStructures/plans/Groupoids.hpp [code] | Plans related to the search for (certain) groupoids |
Applications/Colouring/FrequencyAssignment/plans/general.hpp [code] | Plans for the module on frequency assignment |
Applications/CombinatorialOptimisation/plans/general.hpp [code] | Plans regarding applications of (generalised) SAT to combinatorial optimisation |
Applications/Configurations/MaxComponents/plans/general.hpp [code] | Plans on the "Enigma1277" ("Faron's Puzzle") and generalisations |
Applications/Configurations/NQueens/plans/general.hpp [code] | Plans on the n queens problem |
Applications/Cryptanalysis/docus/general.hpp [code] | Main docus-file for the module on cryptanalysis |
Applications/Cryptanalysis/plans/Factorisation.hpp [code] | Plans for the module on factorisation of natural numbers |
Applications/Cryptanalysis/plans/general.hpp [code] | Plans for the module on cryptanalysis |
Applications/Cryptanalysis/plans/milestones.hpp [code] | |
Applications/Cryptanalysis/plans/Rijndael.hpp [code] | Plans for the module on treating Rijndael |
Applications/docus/general.hpp [code] | Main docus-file for the application part |
Applications/Embeddings/HamiltonianPaths/plans/general.hpp [code] | Plans for the module on Hamiltonian paths (cycles etc.) |
Applications/Embeddings/Isomorphisms/plans/CLSIsomorphisms.hpp [code] | Deciding whether two clause-sets are isomorphic by reductions to (generalised) SAT problems |
Applications/Embeddings/Isomorphisms/plans/general.hpp [code] | Plans for the module on isomorphisms |
Applications/Embeddings/Isomorphisms/plans/GraphIsomorphisms.hpp [code] | Algorithms to determine graph isomorphisms (directly or by reducing it to (generalised) SAT problems) |
Applications/Games/plans/Chess.hpp [code] | Submodule for chess playing and SAT |
Applications/Games/plans/general.hpp [code] | Module for game playing via SAT (and beyond) |
Applications/Games/plans/Poker.hpp [code] | Module for poker playing |
Applications/LatinSquares/Sudoku.hpp [code] | Components for solving Sudoku problems |
Applications/LatinSquares/plans/general.hpp [code] | Plans for the module on searching latin squares and generalisations |
Applications/LatinSquares/plans/milestones.hpp [code] | |
Applications/LatinSquares/plans/Sudoku.hpp [code] | Plans for the Sudoku components |
Applications/LatinSquares/testobjects/Sudoku.cpp [code] | |
Applications/LatinSquares/tests/Sudoku.hpp [code] | Tests for Sudoku problem solvers |
Applications/plans/general.hpp [code] | Plans regarding the applications part in general |
Applications/QuantumPhysics/OrthogonalTriples.cpp [code] | Handling orthogonal triples in 3-dimensional Euclidean space |
Applications/QuantumPhysics/plans/FreeWillConfiguration.hpp [code] | Plans regarding the point-configuration in the [Conway; Free Will]-paper |
Applications/QuantumPhysics/plans/general.hpp [code] | Plans regarding certain aspects of quantum physics (as applications of satisfiability) |
Applications/QuantumPhysics/plans/milestones.hpp [code] | |
Applications/QuantumPhysics/plans/OrthogonalTriples.hpp [code] | Plans regarding the elementary algorithms for handling orthogonal triples in 3-dimensional Euclidean space |
Applications/RamseyTheory/CountProgressions_GreenTao.cpp [code] | Application for counting arithmetic progressions in the prime numbers |
Applications/RamseyTheory/MinimumTransversals_GreenTao.cpp [code] | Application for computing minimum transversal of hypergraphs of arithmetic progressions in the primes |
Applications/RamseyTheory/MinimumTransversals_VanderWaerden.cpp [code] | Application for computing minimum transversal of hypergraphs of arithmetic progressions |
Applications/RamseyTheory/PdExtend.cpp [code] | Extending a palindromic vdW-solution to a full solution |
Applications/RamseyTheory/Schur_BHR.cpp [code] | Program from [BHR 2006], adapted to C++ |
Applications/RamseyTheory/SolutionShift.cpp [code] | Adding d>=1 to all variables in a partial assignment |
Applications/RamseyTheory/plans/general.hpp [code] | Plans for the module on Ramsey theory (especially van der Waerden's problem) |
Applications/RamseyTheory/plans/GreenTaoProblems.hpp [code] | Plans on the module on computing Green-Tao numbers (and related quantities) |
Applications/RamseyTheory/plans/milestones.hpp [code] | |
Applications/RamseyTheory/plans/VanderWaerden.hpp [code] | Plans on the module on computing van der Waerden numbers |
Buildsystem/Configuration/ExternalSources/plans/general.hpp [code] | Plans for handling of configuration data regarding external sources |
Buildsystem/Configuration/plans/general.hpp [code] | Plans regarding configuration management |
Buildsystem/Configuration/plans/milestones.hpp [code] | |
Buildsystem/Configuration/plans/Persons.hpp [code] | Plans regarding management of personal data |
Buildsystem/docus/general.hpp [code] | The central docus-file for the buildsystem |
Buildsystem/docus/Linux.hpp [code] | Documentation on techniques regarding Linux (and Bash) which proved useful |
Buildsystem/ExternalSources/docus/general.hpp [code] | General documentation for the makefile "Buildsystem/ExternalSources/Makefile", responsible for external builds |
Buildsystem/ExternalSources/docus/Internals.hpp [code] | Internals of how the build system for external sources works |
Buildsystem/ExternalSources/plans/general.hpp [code] | Plans for building external sources in general |
Buildsystem/ExternalSources/plans/milestones.hpp [code] | |
Buildsystem/ExternalSources/SpecialBuilds/docus/Asciidoc.hpp [code] | Documentation on how to build Asciidoc |
Buildsystem/ExternalSources/SpecialBuilds/docus/Boost.hpp [code] | Documentation on how to build and use Boost |
Buildsystem/ExternalSources/SpecialBuilds/docus/CLisp.hpp [code] | Documentation on how to build CLisp |
Buildsystem/ExternalSources/SpecialBuilds/docus/Coq.hpp [code] | Documentation on how to build Coq |
Buildsystem/ExternalSources/SpecialBuilds/docus/Doxygen.hpp [code] | Documentation on how to build Doxygen |
Buildsystem/ExternalSources/SpecialBuilds/docus/Ecl.hpp [code] | Documentation on how to build Ecl |
Buildsystem/ExternalSources/SpecialBuilds/docus/Espresso.hpp [code] | Documentation on how to build and use Espresso |
Buildsystem/ExternalSources/SpecialBuilds/docus/Gap.hpp [code] | Documentation on how to build Gap |
Buildsystem/ExternalSources/SpecialBuilds/docus/Gcc.hpp [code] | Documentation on how to build Gcc |
Buildsystem/ExternalSources/SpecialBuilds/docus/Git.hpp [code] | Documentation on how to build Git |
Buildsystem/ExternalSources/SpecialBuilds/docus/Gmp.hpp [code] | Documentation on how to build and use Gmp |
Buildsystem/ExternalSources/SpecialBuilds/docus/Grasp.hpp [code] | Documentation on how to build and use Grasp |
Buildsystem/ExternalSources/SpecialBuilds/docus/Maxima.hpp [code] | Documentation on how to build Maxima |
Buildsystem/ExternalSources/SpecialBuilds/docus/Mhash.hpp [code] | Documentation on how to build and use Mhash |
Buildsystem/ExternalSources/SpecialBuilds/docus/Ocaml.hpp [code] | Documentation on how to build Ocaml |
Buildsystem/ExternalSources/SpecialBuilds/docus/Picosat.hpp [code] | Documentation on how to build and use Picosat |
Buildsystem/ExternalSources/SpecialBuilds/docus/Postgresql.hpp [code] | Documentation on how to build Postgresql |
Buildsystem/ExternalSources/SpecialBuilds/docus/R.hpp [code] | Documentation on how to build R |
Buildsystem/ExternalSources/SpecialBuilds/docus/Sage.hpp [code] | Documentation on how to build Sage |
Buildsystem/ExternalSources/SpecialBuilds/docus/Ubcsat.hpp [code] | Documentation on how to build and use Ubcsat |
Buildsystem/ExternalSources/SpecialBuilds/docus/Valgrind.hpp [code] | Documentation on how to build Valgrind |
Buildsystem/ExternalSources/SpecialBuilds/plans/Aldor.hpp [code] | Plans regarding installation of Aldor |
Buildsystem/ExternalSources/SpecialBuilds/plans/ATP.hpp [code] | Plans regarding installation of automated theorem provers |
Buildsystem/ExternalSources/SpecialBuilds/plans/Axiom.hpp [code] | Plans regarding installation of Axiom |
Buildsystem/ExternalSources/SpecialBuilds/plans/BooleanFunctions.hpp [code] | Plans regarding building packages related to boolean functions |
Buildsystem/ExternalSources/SpecialBuilds/plans/Boost.hpp [code] | Plans regarding installation of the Boost library |
Buildsystem/ExternalSources/SpecialBuilds/plans/ComputerAlgebra.hpp [code] | Plans regarding building of computer algebra systems |
Buildsystem/ExternalSources/SpecialBuilds/plans/Coq.hpp [code] | Plans regarding installation of Coq |
Buildsystem/ExternalSources/SpecialBuilds/plans/Cryptography.hpp [code] | Plans regarding building and making available of cryptology software and benchmarks |
Buildsystem/ExternalSources/SpecialBuilds/plans/CSP.hpp [code] | Plans regarding installation of constraint satisfaction systems |
Buildsystem/ExternalSources/SpecialBuilds/plans/Doxygen.hpp [code] | Plans regarding building of Doxygen |
Buildsystem/ExternalSources/SpecialBuilds/plans/Ecl.hpp [code] | Plans regarding installation of the Common-Lisp Ecl |
Buildsystem/ExternalSources/SpecialBuilds/plans/EvolutionaryProgramming.hpp [code] | Plans regarding installation of systems for genetic algorithms etc |
Buildsystem/ExternalSources/SpecialBuilds/plans/Games.hpp [code] | Plans regarding installation of tools related to game theory |
Buildsystem/ExternalSources/SpecialBuilds/plans/GAP.hpp [code] | Plans regarding building of the GAP system |
Buildsystem/ExternalSources/SpecialBuilds/plans/Gcc.hpp [code] | Plans regarding installation of gcc |
Buildsystem/ExternalSources/SpecialBuilds/plans/general.hpp [code] | Plans regarding building of concrete external sources |
Buildsystem/ExternalSources/SpecialBuilds/plans/Git.hpp [code] | Plans regarding installation of Git |
Buildsystem/ExternalSources/SpecialBuilds/plans/Gmp.hpp [code] | Plans regarding installation of gmp |
Buildsystem/ExternalSources/SpecialBuilds/plans/Graphs.hpp [code] | Plans regarding installation of tools related to graph theory |
Buildsystem/ExternalSources/SpecialBuilds/plans/Lisp.hpp [code] | Plans regarding installation of Lisp compiler/interpreters othen then Ecl (the current default) |
Buildsystem/ExternalSources/SpecialBuilds/plans/Logics.hpp [code] | Plans regarding building of (general) logic systems |
Buildsystem/ExternalSources/SpecialBuilds/plans/MachineLearning.hpp [code] | Plans regarding installation of machine-learning software |
Buildsystem/ExternalSources/SpecialBuilds/plans/Maxima.hpp [code] | Plans regarding installation of Maxima |
Buildsystem/ExternalSources/SpecialBuilds/plans/Mhash.hpp [code] | Plans regarding installation of the Mhash library |
Buildsystem/ExternalSources/SpecialBuilds/plans/milestones.hpp [code] | |
Buildsystem/ExternalSources/SpecialBuilds/plans/ModelChecking.hpp [code] | Plans regarding building model checking tools |
Buildsystem/ExternalSources/SpecialBuilds/plans/Optimisation.hpp [code] | Plans regarding installation of systems for (general) optimisation |
Buildsystem/ExternalSources/SpecialBuilds/plans/PostgreSQL.hpp [code] | Plans regarding installation of the PostgreSQL package |
Buildsystem/ExternalSources/SpecialBuilds/plans/Prolog.hpp [code] | Plans regarding installation of Prolog systems |
Buildsystem/ExternalSources/SpecialBuilds/plans/PseudoBoolean.hpp [code] | Plans regarding building of pseudo-boolean solvers and libraries |
Buildsystem/ExternalSources/SpecialBuilds/plans/QBF.hpp [code] | Plans regarding building of QBF solvers |
Buildsystem/ExternalSources/SpecialBuilds/plans/R.hpp [code] | Plans regarding installation of R |
Buildsystem/ExternalSources/SpecialBuilds/plans/RamseyTheory.hpp [code] | Plans regarding building of external sources related to Ramsey theory |
Buildsystem/ExternalSources/SpecialBuilds/plans/Sage.hpp [code] | Plans regarding installation of Sage |
Buildsystem/ExternalSources/SpecialBuilds/plans/SAT.hpp [code] | Plans regarding building of SAT solvers and libraries |
Buildsystem/ExternalSources/SpecialBuilds/plans/Ubcsat.hpp [code] | Plans regarding installation of the Ubcsat package |
Buildsystem/ExternalSources/SpecialBuilds/plans/Valgrind.hpp [code] | Plans regarding building of the Valgrind tool |
Buildsystem/Html/Internet/plans/general.hpp [code] | Plans for the internet services (web page, etc.) |
Buildsystem/Html/Internet/plans/milestones.hpp [code] | |
Buildsystem/Html/Local/plans/ExternalSources.hpp [code] | Plans for the main local page on external sources |
Buildsystem/Html/Local/plans/general.hpp [code] | Plans for the local html pages (around the local home page) |
Buildsystem/Html/Local/plans/History.hpp [code] | Plans for the page on the history of the OKlibrary |
Buildsystem/Html/Local/plans/HomePage.hpp [code] | Plans for the main local page |
Buildsystem/Html/Local/plans/milestones.hpp [code] | |
Buildsystem/Html/Local/plans/TenChallenges.hpp [code] | Plans for the "Ten Challenges" entry page |
Buildsystem/Html/plans/general.hpp [code] | General plans regarding the html-services |
Buildsystem/Html/plans/milestones.hpp [code] | |
Buildsystem/MasterScript/docus/general.hpp [code] | Documentation on the program for executing build-actions |
Buildsystem/MasterScript/plans/general.hpp [code] | Plans for the masterscript, the "user-interface" to the build system |
Buildsystem/MasterScript/plans/milestones.hpp [code] | |
Buildsystem/MasterScript/SpecialProcessing/maxima-init.mac [code] | |
Buildsystem/MasterScript/SpecialProcessing/plans/Call_Maxima.hpp [code] | Plans for the components reponsible for calling Maxima |
Buildsystem/MasterScript/SpecialProcessing/plans/general.hpp [code] | Plans for the components reponsible for calling sub-systems like Maxima or R |
Buildsystem/MasterScript/SpecialProcessing/plans/Maxima_Init.hpp [code] | Plans regarding initialisation of Maxima |
Buildsystem/MasterScript/SpecialProcessing/plans/milestones.hpp [code] | |
Buildsystem/OKlibBuilding/docus/general.hpp [code] | General documentation for the central makefile Buildsystem/OKlibBuilding/Makefile |
Buildsystem/OKlibBuilding/plans/general.hpp [code] | Build-related plans for the OKlibrary (in the strict sense) |
Buildsystem/OKlibBuilding/plans/MakeSystem.hpp [code] | Plans for the core part of the build system, the make- or make-like engine |
Buildsystem/OKlibBuilding/plans/milestones.hpp [code] | |
Buildsystem/OKlibBuilding/plans/TargetSpecifications.hpp [code] | Precise definitions of the targets for the build-system |
Buildsystem/OKlibBuilding/Targets/html/plans/general.hpp [code] | Plans for the documentation-extraction from the source-code |
Buildsystem/OKlibBuilding/Targets/html/plans/milestones.hpp [code] | |
Buildsystem/OKlibBuilding/Targets/new_check/maxima_init_tests.mac [code] | |
Buildsystem/plans/CheckBuildSystem.hpp [code] | Plans regarding testing the build system |
Buildsystem/plans/general.hpp [code] | Plans for the buildsystem in general |
Buildsystem/plans/Makefile.hpp [code] | Plans for the buildsystem-makefile |
Buildsystem/plans/milestones.hpp [code] | |
Buildsystem/plans/SetUp.hpp [code] | Plans for the makefile "SetUp.mak", which does the very first set-up |
Buildsystem/ReleaseProcess/plans/general.hpp [code] | Plans regarding the release process in general |
Buildsystem/ReleaseProcess/plans/MailingLists.hpp [code] | Plans for the mailing lists |
Buildsystem/ReleaseProcess/plans/milestones.hpp [code] | |
Buildsystem/ReleaseProcess/plans/PackageBuilding.hpp [code] | Plans regarding package building |
Buildsystem/ReleaseProcess/plans/README.hpp [code] | Plans for the README file |
Buildsystem/ReleaseProcess/plans/Release.hpp [code] | Plans regarding releasing the software |
Buildsystem/SourceControl/plans/Branching.hpp [code] | Todos and plans regarding branching |
Buildsystem/SourceControl/plans/general.hpp [code] | Plans and todos for the versioning control system |
Buildsystem/SourceControl/plans/Github.hpp [code] | Plans and todos for accessing and maintaining the OKlibrary via "Github" |
Buildsystem/SourceControl/plans/milestones.hpp [code] | |
Combinatorics/docus/general.hpp [code] | Main docus-file for the combinatorics part |
Combinatorics/Enumeration/plans/general.hpp [code] | General plans on the enumeration module |
Combinatorics/Enumeration/plans/GrayCodes.hpp [code] | Tools to enumerate combinations, that is all elements of A_1 x ... x A_n for finite linearly ordered sets A_i, in the order given by Gray codes |
Combinatorics/Enumeration/plans/milestones.hpp [code] | |
Combinatorics/Enumeration/plans/Permutations.hpp [code] | Tools for enumeration of permutations |
Combinatorics/Enumeration/plans/Subsets.hpp [code] | Tools for enumeration of all subsets of a set |
Combinatorics/Graphs/BoostSupport/Auxiliary.hpp [code] | |
Combinatorics/Graphs/BoostSupport/Concepts_Graphs.hpp [code] | |
Combinatorics/Graphs/BoostSupport/demo_read_graph.cpp [code] | Demonstrating reading a graph in the "DOT" language |
Combinatorics/Graphs/BoostSupport/Generators.hpp [code] | Old attempt by BSc project (Kate) for generators |
Combinatorics/Graphs/BoostSupport/Graphs.hpp [code] | |
Combinatorics/Graphs/BoostSupport/Support.hpp [code] | |
Combinatorics/Graphs/BoostSupport/Test.cpp [code] | |
Combinatorics/Graphs/BoostSupport/Tests_Generators.hpp [code] | |
Combinatorics/Graphs/BoostSupport/plans/general.hpp [code] | General plans regarding support for the Boost graph library |
Combinatorics/Graphs/BoostSupport/plans/milestones.hpp [code] | |
Combinatorics/Graphs/DominatingSets/plans/general.hpp [code] | Plans for the general module on graph-components |
Combinatorics/Graphs/EdgeCovers/plans/general.hpp [code] | Plans regarding edge covers |
Combinatorics/Graphs/IndependentSets/plans/general.hpp [code] | Plans regarding independent sets |
Combinatorics/Graphs/Isomorphisms/SimpleBacktracking.cpp [code] | Application for isomorphism testing of graphs via the Boost backtracking implementation |
Combinatorics/Graphs/Isomorphisms/plans/general.hpp [code] | Algorithms to determine graph isomorphisms directly |
Combinatorics/Graphs/Matchings/plans/general.hpp [code] | Plans for matchings in graphs |
Combinatorics/Graphs/Matchings/plans/milestones.hpp [code] | |
Combinatorics/Graphs/plans/general.hpp [code] | Plans for the general module on graph-components |
Combinatorics/Graphs/plans/GraphTraversal.hpp [code] | Plans for the sub-module on graph-traversal |
Combinatorics/Graphs/plans/milestones.hpp [code] | |
Combinatorics/Graphs/TreeDecompositions/EliminationSequences.hpp [code] | Methods for handling elimination sequences for graphs (related to the notion of treewidth) |
Combinatorics/Graphs/TreeDecompositions/EliminationSequences_Testobjects.hpp [code] | |
Combinatorics/Graphs/TreeDecompositions/EliminationSequences_Tests.hpp [code] | Tests for the methods for handling elimination sequences for graphs (related to the notion of treewidth) |
Combinatorics/Graphs/TreeDecompositions/TestTreeDecompositions.cpp [code] | |
Combinatorics/Graphs/TreeDecompositions/plans/EliminationSequences.hpp [code] | Plans tree decompositions via elimination sequences |
Combinatorics/Graphs/TreeDecompositions/plans/general.hpp [code] | Plans for the module regarding tree decompositions |
Combinatorics/Graphs/TreeDecompositions/plans/milestones.hpp [code] | |
Combinatorics/Graphs/VertexCovers/plans/general.hpp [code] | Plans regarding vertex covers |
Combinatorics/Hypergraphs/Colourings/GreedyColouring.cpp [code] | Application for performing greedy graph colouring (prototype) |
Combinatorics/Hypergraphs/Colourings/GreedyColouring.hpp [code] | Components related to the greedy colouring algorithm |
Combinatorics/Hypergraphs/Colourings/plans/general.hpp [code] | Plans for the module on hypergraph (and graph) colouring |
Combinatorics/Hypergraphs/Colourings/plans/GreedyColouring.hpp [code] | Plans regarding the greedy graph colouring algorithm |
Combinatorics/Hypergraphs/Colourings/plans/milestones.hpp [code] | |
Combinatorics/Hypergraphs/Colourings/plans/StrongColouring.hpp [code] | Plans on strong hypergraph colouring (all vertices in any hyperedges get different colours) |
Combinatorics/Hypergraphs/concepts/plans/general.hpp [code] | Plans for concepts regarding hypergraphs |
Combinatorics/Hypergraphs/concepts/plans/milestones.hpp [code] | |
Combinatorics/Hypergraphs/Generators/GreenTao.cpp [code] | Application for generating GreenTao hypergraphs |
Combinatorics/Hypergraphs/Generators/GreenTao.hpp [code] | Tools for generating Green-Tao hypergraphs |
Combinatorics/Hypergraphs/Generators/Hindman.hpp [code] | Tools for generating Hindman hypergraphs |
Combinatorics/Hypergraphs/Generators/PdVanderWaerden.cpp [code] | Application for generating palindromic van der Waerden hypergraphs |
Combinatorics/Hypergraphs/Generators/TestHypergraphGenerators.cpp [code] | |
Combinatorics/Hypergraphs/Generators/VanderWaerden.hpp [code] | Tools for generating van der Waerden hypergraphs |
Combinatorics/Hypergraphs/Generators/VanderWaerden_Testobjects.hpp [code] | |
Combinatorics/Hypergraphs/Generators/VanderWaerden_Tests.hpp [code] | |
Combinatorics/Hypergraphs/Generators/plans/general.hpp [code] | Plans on generators for hypergraphs |
Combinatorics/Hypergraphs/Generators/plans/GreenTao.hpp [code] | Plans on generators for Green-Tao-hypergraphs |
Combinatorics/Hypergraphs/Generators/plans/Hindman.hpp [code] | Plans on generators for Hindman-hypergraphs |
Combinatorics/Hypergraphs/Generators/plans/VanderWaerden.hpp [code] | Plans on generators for vdW-hypergraphs |
Combinatorics/Hypergraphs/Generators/testobjects/GreenTao.cpp [code] | |
Combinatorics/Hypergraphs/Generators/testobjects/Hindman.cpp [code] | |
Combinatorics/Hypergraphs/Generators/tests/GreenTao.hpp [code] | Generic tests for algorithms generating GreenTao hypergraphs |
Combinatorics/Hypergraphs/Generators/tests/Hindman.hpp [code] | Generic tests for algorithms generating Hindman hypergraphs |
Combinatorics/Hypergraphs/HyperedgeCoverings/plans/general.hpp [code] | Plans regarding coverings of hypergraphs by hyperedges |
Combinatorics/Hypergraphs/IndependentSets/plans/general.hpp [code] | Plans regarding independent (vertex) sets in hypergraphs |
Combinatorics/Hypergraphs/Matchings/plans/general.hpp [code] | Plans regarding disjoint hyperedge sets in hypergraphs |
Combinatorics/Hypergraphs/plans/general.hpp [code] | Components for hypergraph algorithms |
Combinatorics/Hypergraphs/plans/milestones.hpp [code] | |
Combinatorics/Hypergraphs/Transversals/Bounded/BoundedTransversals_bv.cpp [code] | Application for computing all size-bounded transversals of a hypergraph |
Combinatorics/Hypergraphs/Transversals/Bounded/MinimumTransversalsMongen.cpp [code] | Application for computing all minimum transversals of a monotone series of hypergraphs |
Combinatorics/Hypergraphs/Transversals/Bounded/MinimumTransversalsMongen.hpp [code] | Header file for creating instances of this application for computing all minimum transversals of a monotone series of hypergraphs |
Combinatorics/Hypergraphs/Transversals/Bounded/VertexBranching.hpp [code] | Computing (basically) all transversals of size up to B, by branching on vertices |
Combinatorics/Hypergraphs/Transversals/Bounded/plans/general.hpp [code] | Plans for the module on computing hypergraph transversals of size at most k |
Combinatorics/Hypergraphs/Transversals/Bounded/plans/milestones.hpp [code] | |
Combinatorics/Hypergraphs/Transversals/Minimal/plans/DirectTransversalEnumeration.hpp [code] | Implementations of enumerations of hypergraph transversals based on the direct method |
Combinatorics/Hypergraphs/Transversals/Minimal/plans/general.hpp [code] | Implementations of enumerations of hypergraph transversals |
Combinatorics/Hypergraphs/Transversals/Minimal/plans/milestones.hpp [code] | |
Combinatorics/Hypergraphs/Transversals/plans/ExactTransversals.hpp [code] | Plans regarding exact transversals |
Combinatorics/Hypergraphs/Transversals/plans/general.hpp [code] | Plans for the module on hypergraph transversals |
Combinatorics/Hypergraphs/Transversals/plans/milestones.hpp [code] | |
Combinatorics/plans/general.hpp [code] | Plans for the combinatorics module |
Combinatorics/plans/milestones.hpp [code] | |
Combinatorics/traits/range_type.hpp [code] | Traits-metafunction to extract the range type |
ComputerAlgebra/include.mac [code] | Central inclusion file for all Maxima functions |
ComputerAlgebra/AbstractDataTypes/Lisp/plans/general.hpp [code] | Plans for Maxima-components regarding abstract data types |
ComputerAlgebra/Algebra/Lisp/FiniteFields.mac [code] | Finite field functions |
ComputerAlgebra/Algebra/Lisp/include.mac [code] | Inclusion of Maxima algebra functionality |
ComputerAlgebra/Algebra/Lisp/docus/FiniteFields.hpp [code] | User documentation for finite fields in Lisp/Maxima |
ComputerAlgebra/Algebra/Lisp/docus/general.hpp [code] | User documentation for algebra in Lisp/Maxima |
ComputerAlgebra/Algebra/Lisp/Groupoids/Associativity.mac [code] | Various associativity tests |
ComputerAlgebra/Algebra/Lisp/Groupoids/BasicNotions.mac [code] | Basic notions (like test-predicates and conversions) for groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/Closures.mac [code] | Regarding the sub-groupoid generated by a set of elements |
ComputerAlgebra/Algebra/Lisp/Groupoids/Commutativity.mac [code] | Various commutativity tests |
ComputerAlgebra/Algebra/Lisp/Groupoids/Constructions.mac [code] | Basic constructions of groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/Enumeration.mac [code] | Enumerating groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/Homomorphisms.mac [code] | Basic operations for groupoid homomorphisms |
ComputerAlgebra/Algebra/Lisp/Groupoids/Idempotency.mac [code] | Tests and search-functions regarding itempotent elements |
ComputerAlgebra/Algebra/Lisp/Groupoids/include.mac [code] | Inclusion of Maxima groupoid-related functionality |
ComputerAlgebra/Algebra/Lisp/Groupoids/InvertibleElements.mac [code] | Tests and search-functions regarding invertible elements |
ComputerAlgebra/Algebra/Lisp/Groupoids/NeutralElements.mac [code] | Tests and search-functions regarding neutral (identity) elements |
ComputerAlgebra/Algebra/Lisp/Groupoids/NullElements.mac [code] | Tests and search-functions regarding null elements |
ComputerAlgebra/Algebra/Lisp/Groupoids/TranslationActions.mac [code] | Regarding the action of the base set of a groupoid on itself by left/right translation |
ComputerAlgebra/Algebra/Lisp/Groupoids/UniquelySolvableElements.mac [code] | Tests and search-functions regarding "permutation elements" |
ComputerAlgebra/Algebra/Lisp/Groupoids/Actions/BasicNotions.mac [code] | Basic notions (like test-predicates and conversions) for actions of sets |
ComputerAlgebra/Algebra/Lisp/Groupoids/Actions/include.mac [code] | Inclusion of Maxima action-related functionality |
ComputerAlgebra/Algebra/Lisp/Groupoids/Actions/plans/general.hpp [code] | Plans in general regarding actions of sets |
ComputerAlgebra/Algebra/Lisp/Groupoids/Actions/testobjects/BasicNotions.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/Actions/tests/BasicNotions.mac [code] | Tests for the basic groupoid-notions |
ComputerAlgebra/Algebra/Lisp/Groupoids/Groups/CyclicGroups.mac [code] | Implementing cyclic groups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Groups/DiederGroups.mac [code] | Implementing Dieder groups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Groups/include.mac [code] | Inclusion of Maxima group-related functionality |
ComputerAlgebra/Algebra/Lisp/Groupoids/Groups/LinearGroups.mac [code] | Functions regarding linear groups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Groups/SymmetricGroups.mac [code] | Implementing symmetric groups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Groups/PermutationGroups/plans/general.hpp [code] | General plans for permutation groups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Groups/plans/general.hpp [code] | Plans in general regarding groups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Groups/plans/SymmetricGroups.hpp [code] | Plans on providing the basic symmetric groups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Groups/testobjects/CyclicGroups.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/Groups/testobjects/SymmetricGroups.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/Groups/tests/CyclicGroups.mac [code] | Tests regarding cyclic groups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Groups/tests/SymmetricGroups.mac [code] | Tests regarding symmetric groups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Operations/BasicNotions.mac [code] | Basic notions (like test-predicates and conversions) for operations of groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/Operations/include.mac [code] | Inclusion of functionality regarding the operation of groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/Operations/plans/general.hpp [code] | Plans in general regarding operations of groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/Operations/testobjects/BasicNotions.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/Operations/tests/BasicNotions.mac [code] | Tests for monoids of partial assignments |
ComputerAlgebra/Algebra/Lisp/Groupoids/plans/BasicNotions.hpp [code] | Plans on groupoids regarding the most basic notions |
ComputerAlgebra/Algebra/Lisp/Groupoids/plans/Closures.hpp [code] | Plans on computing hulls for groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/plans/Commutativity.hpp [code] | Plans regarding notions associated to commutativity in general |
ComputerAlgebra/Algebra/Lisp/Groupoids/plans/Constructions.hpp [code] | Plans on general constructions for groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/plans/Enumeration.hpp [code] | Plans on enumerating groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/plans/general.hpp [code] | Plans in general regarding groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/plans/Homomorphisms.hpp [code] | Plans on groupoid homomorphisms |
ComputerAlgebra/Algebra/Lisp/Groupoids/plans/milestones.hpp [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/Quasigroups/Basics.mac [code] | Basic functionality for quasigroups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Quasigroups/include.mac [code] | Inclusion of Maxima quasigroup-related functionality |
ComputerAlgebra/Algebra/Lisp/Groupoids/Quasigroups/plans/Enumeration.hpp [code] | Plans regarding enumeration of quasi-groups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Quasigroups/plans/general.hpp [code] | Plans in general regarding quasi-groups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Quasigroups/testobjects/Basics.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/Quasigroups/tests/Basics.mac [code] | Tests for the basic groupoid-notions |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/BasicExamples.mac [code] | Basic examples for semigroups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/include.mac [code] | Inclusion of Maxima semigroup-related functionality |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/Order.mac [code] | Functions related to the order of elements |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/PartialAssignments.mac [code] | The monoid of partial assignments |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/TransformationMonoids.mac [code] | Implementing transformation semigroups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/plans/Enumeration.hpp [code] | Plans regarding enumeration of semigroups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/plans/general.hpp [code] | Plans in general regarding semigroups |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/testobjects/BasicExamples.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/testobjects/Order.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/testobjects/PartialAssignments.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/testobjects/TransformationMonoids.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/tests/BasicExamples.mac [code] | Tests for monoids of partial assignments |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/tests/Order.mac [code] | Tests for monoids of partial assignments |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/tests/PartialAssignments.mac [code] | Tests for monoids of partial assignments |
ComputerAlgebra/Algebra/Lisp/Groupoids/Semigroups/tests/TransformationMonoids.mac [code] | Tests for transformation monoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/testobjects/BasicNotions.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/testobjects/Closures.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/testobjects/Commutativity.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/testobjects/Constructions.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/testobjects/Enumeration.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/testobjects/Homomorphisms.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/testobjects/Idempotency.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/testobjects/InvertibleElements.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/testobjects/NeutralElements.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/testobjects/NullElements.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/testobjects/UniquelySolvableElements.mac [code] | |
ComputerAlgebra/Algebra/Lisp/Groupoids/tests/BasicNotions.mac [code] | Tests for the basic groupoid-notions |
ComputerAlgebra/Algebra/Lisp/Groupoids/tests/Closures.mac [code] | Tests for the basic groupoid-notions |
ComputerAlgebra/Algebra/Lisp/Groupoids/tests/Commutativity.mac [code] | Tests for the functions related to commutativity in groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/tests/Constructions.mac [code] | Tests for the basic groupoid-notions |
ComputerAlgebra/Algebra/Lisp/Groupoids/tests/Enumeration.mac [code] | Tests regarding enumeration of groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/tests/Homomorphisms.mac [code] | Tests for the basic homomorphism functionality |
ComputerAlgebra/Algebra/Lisp/Groupoids/tests/Idempotency.mac [code] | Tests regarding idempotent elements in groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/tests/InvertibleElements.mac [code] | Tests regarding invertible elements in groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/tests/NeutralElements.mac [code] | Tests regarding neutral elements in groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/tests/NullElements.mac [code] | Tests regarding null elements in groupoids |
ComputerAlgebra/Algebra/Lisp/Groupoids/tests/UniquelySolvableElements.mac [code] | Tests regarding null elements in groupoids |
ComputerAlgebra/Algebra/Lisp/plans/FiniteFields.hpp [code] | Plans on handling finite fields |
ComputerAlgebra/Algebra/Lisp/plans/general.hpp [code] | Plans in general for algebra functionality via Maxima/Lisp |
ComputerAlgebra/Algebra/Lisp/plans/milestones.hpp [code] | |
ComputerAlgebra/Algebra/Lisp/Ringframes/BasicNotions.mac [code] | Basic notions (like test-predicates and conversions) for sets with two (inner) binary operations |
ComputerAlgebra/Algebra/Lisp/Ringframes/include.mac [code] | Inclusion of functions regarding ringframes (rings, etc.) |
ComputerAlgebra/Algebra/Lisp/Ringframes/plans/BasicNotions.hpp [code] | Plans about the general notions for ringframes |
ComputerAlgebra/Algebra/Lisp/Ringframes/plans/general.hpp [code] | Plans in general regarding ringframes |
ComputerAlgebra/Algebra/Lisp/Ringframes/Rings/include.mac [code] | Inclusion of functions regarding rings |
ComputerAlgebra/Algebra/Lisp/Ringframes/Rings/ResidueClasses.mac [code] | Providing implementations of rings of residue classes (modular arithmetic) |
ComputerAlgebra/Algebra/Lisp/testobjects/FiniteFields.mac [code] | |
ComputerAlgebra/Algebra/Lisp/tests/FiniteFields.mac [code] | Tests for Finite Field functions |
ComputerAlgebra/Algebra/plans/general.hpp [code] | Plans in general for algebra functionality |
ComputerAlgebra/Algebra/plans/milestones.hpp [code] | |
ComputerAlgebra/AutomatedTheoremProving/plans/general.hpp [code] | Plans for automated theorem proving using computer algebra systems |
ComputerAlgebra/Categories/Lisp/BasicNotions.mac [code] | Basic notions (like test-predicates and conversions) for categories |
ComputerAlgebra/Categories/Lisp/plans/general.hpp [code] | Plans in general for categories in Maxima/Lisp |
ComputerAlgebra/CombinatorialMatrices/Lisp/Basics.mac [code] | Basic functionality for combinatorial matrices |
ComputerAlgebra/CombinatorialMatrices/Lisp/include.mac [code] | Inclusion file for Maxima combinatorial matrix functions |
ComputerAlgebra/CombinatorialMatrices/Lisp/Isomorphisms.mac [code] | Isomorphisms testing for combinatorial matrices |
ComputerAlgebra/CombinatorialMatrices/Lisp/AssociationSchemes/plans/general.hpp [code] | General plans regarding association schemes |
ComputerAlgebra/CombinatorialMatrices/Lisp/LatinSquares/BasicNotions.mac [code] | Basic notions regarding latin squares |
ComputerAlgebra/CombinatorialMatrices/Lisp/LatinSquares/include.mac [code] | Inclusion file for Maxima functions about latin squares |
ComputerAlgebra/CombinatorialMatrices/Lisp/LatinSquares/plans/BasicNotions.hpp [code] | Plans regarding the basic notions about latin squares |
ComputerAlgebra/CombinatorialMatrices/Lisp/LatinSquares/plans/general.hpp [code] | Plans regarding latin squares in general |
ComputerAlgebra/CombinatorialMatrices/Lisp/LatinSquares/testobjects/BasicNotions.mac [code] | |
ComputerAlgebra/CombinatorialMatrices/Lisp/LatinSquares/tests/BasicNotions.mac [code] | Tests regarding basic notions for latin squares |
ComputerAlgebra/CombinatorialMatrices/Lisp/plans/Basics.hpp [code] | General plans regarding basic notions and functions for (combinatorial) matrices |
ComputerAlgebra/CombinatorialMatrices/Lisp/plans/general.hpp [code] | |
ComputerAlgebra/CombinatorialMatrices/Lisp/plans/Isomorphisms.hpp [code] | Plans for isomorphisms of (combinatorial) matrices |
ComputerAlgebra/CombinatorialMatrices/Lisp/testobjects/Basics.mac [code] | |
ComputerAlgebra/CombinatorialMatrices/Lisp/testobjects/Isomorphisms.mac [code] | |
ComputerAlgebra/CombinatorialMatrices/Lisp/tests/Basics.mac [code] | Tests for splitting trees |
ComputerAlgebra/CombinatorialMatrices/Lisp/tests/Isomorphisms.mac [code] | Tests regarding isomorphisms of combinatorial matrices |
ComputerAlgebra/CombinatorialMatrices/plans/general.hpp [code] | General plans regarding combinatorial matrix theory (in computer algebra system) |
ComputerAlgebra/Combinatorics/Lisp/include.mac [code] | Inclusion file for Maxima combinatorics-related functions |
ComputerAlgebra/Combinatorics/Lisp/Counting/plans/general.hpp [code] | General plans regarding counting of classical combinatorial objects |
ComputerAlgebra/Combinatorics/Lisp/docus/general.hpp [code] | Central docus-file for ordinary combinatorics at the Maxima/Lisp level |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/Basics.mac [code] | Basic concepts and tools regarding enumeration of basic combinatorial objects |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/include.mac [code] | Inclusion file for Maxima combinatorics enumeration-related functions |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/Order.mac [code] | Fundamental orders on combinatorial objects |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/Permutations.mac [code] | Permutations enumeration functions |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/Subsets.mac [code] | Subset enumeration functions |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/docus/general.hpp [code] | Central docus-file for enumeration at the Maxima/Lisp level |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/plans/general.hpp [code] | General plans regarding enumerating basic combinatorial objects (in the algorithmic sense, as opposed to just counting) |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/plans/milestones.hpp [code] | |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/plans/Subsets.hpp [code] | Plans regarding enumerating subsets (all, or only specific ones) |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/testobjects/Order.mac [code] | |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/testobjects/Permutations.mac [code] | |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/testobjects/Subsets.mac [code] | |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/tests/Order.mac [code] | Tests regarding ordering of combinatorical objects |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/tests/Permutations.mac [code] | Tests for enumeration of permutations |
ComputerAlgebra/Combinatorics/Lisp/Enumeration/tests/Subsets.mac [code] | Tests for subset enumeration |
ComputerAlgebra/Combinatorics/plans/general.hpp [code] | General plans regarding "traditional" combinatorics, counting and enumeration |
ComputerAlgebra/Combinatorics/plans/milestones.hpp [code] | |
ComputerAlgebra/Cryptology/Aldor/plans/Rijndael.hpp [code] | Plans for cryptological tools regarding the Rijndael cipher using Aldor/Axiom |
ComputerAlgebra/Cryptology/docus/Rijndael.hpp [code] | The docus for computer algebra system implementations of the Rijndael block cipher |
ComputerAlgebra/Cryptology/Lisp/Conversions.mac [code] | Conversion functions for use in Cryptology |
ComputerAlgebra/Cryptology/Lisp/include.mac [code] | Inclusion of Maxima cryptology-functions |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/include.mac [code] | Inclusion of Maxima cryptanalysis-functions |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/DataEncryptionStandard/ConstraintTranslation.mac [code] | Translating the computation of DES into a system of "constraints" |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/DataEncryptionStandard/GeneralisedConstraintTranslation.mac [code] | Translating the computation of generalised DES into a system of "constraints" |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/DataEncryptionStandard/include.mac [code] | Inclusion of cryptanalytic functions for DES |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/DataEncryptionStandard/Sboxes.mac [code] | Tools for the cryptanalysis of the 8 S-boxes of DES |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/DataEncryptionStandard/plans/general.hpp [code] | Plans for the cryptanalysis of the Data Encryption Standard in Maxima/Lisp |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/DataEncryptionStandard/plans/milestones.hpp [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/DataEncryptionStandard/testobjects/ConstraintTranslation.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/DataEncryptionStandard/testobjects/GeneralisedConstraintTranslation.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/DataEncryptionStandard/testobjects/Sboxes.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/DataEncryptionStandard/tests/ConstraintTranslation.mac [code] | Tests regarding constraint translations of DES |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/DataEncryptionStandard/tests/GeneralisedConstraintTranslation.mac [code] | Tests regarding constraint translations of DES with arbitrary numbers of rounds |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/DataEncryptionStandard/tests/Sboxes.mac [code] | Tests regarding constraint translations of DES |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/plans/general.hpp [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/plans/milestones.hpp [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/ConstraintTemplateGlobalPropagation.mac [code] | System for taking a set of constraints and propagating the effect of certain constraints across the set |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/ConstraintTemplateRewriteRules.mac [code] | Functions for translating AES constraint templates into further AES constraint templates and CNF representations |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/ConstraintTemplateRewriteSystem.mac [code] | System for iteratively translating a system of constraint templates into another representation system (CNF etc) |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/ConstraintTemplateSmallScaleRewriteRules.mac [code] | Functions for translating small-scale AES constraint templates into further AES constraint templates and CNF representations |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/ConstraintTemplateTranslation.mac [code] | System for iteratively translating a system of constraint templates into another representation system (CNF etc) |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/FieldOperationsAnalysis.mac [code] | Cryptanalysis functions and tools regarding AES/Rijndael field operations |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/include.mac [code] | Inclusion of Maxima Rijndael cryptanalysis-functions |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/SboxAnalysis.mac [code] | Cryptanalysis functions and tools regarding AES/Rijndael Sbox |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/Translations.mac [code] | Cryptanalysis functions for translations of Rijndael into active clauses etc |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/data/FieldMul11CNF.mac [code] | Example CNF for the Rijndael byte field multiplication by 11 i.e. "x^3+ x + 1" |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/data/FieldMul13CNF.mac [code] | Example CNF for the Rijndael byte field multiplication by 13 i.e. "x^3+x^2+1" |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/data/FieldMul14CNF.mac [code] | Example CNF for the Rijndael byte field multiplication by 14 or "x^3+x^2+x" |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/data/FieldMul2CNF.mac [code] | Example CNF for the Rijndael byte field multiplication by 02 or "x" |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/data/FieldMul3CNF.mac [code] | CNF for the Rijndael byte field multiplication by 03 or "x+1" |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/data/FieldMul9CNF.mac [code] | Example CNF for the Rijndael byte field multiplication by 9 i.e. "x^3 + 1" |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/data/SboxCNF.mac [code] | Example CNF for the Rijndael Sbox |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/data/SmallScaleFieldMulCNF.mac [code] | CNF and r_1-based CNF representations with smallest number of clauses known for each small scale field multiplication |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/data/SmallScaleSboxCNF.mac [code] | CNF and r_1-based CNF representations with smallest number of clauses known for each small scale Sbox |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/docus/ConstraintTemplateRewriteSystem.hpp [code] | User documentation for the Maxima computer algebra system implementation of a constraint template rewrite system |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/docus/general.hpp [code] | User documentation for the Maxima computer algebra system implementation of the AES constraint translations |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/docus/Translations.hpp [code] | User documentation for the Maxima computer algebra system implementation of the AES constraint translations |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/plans/ActiveClauses.hpp [code] | Plans on translating AES into active clauses |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/plans/ConstraintTemplateRewriteRules.hpp [code] | Plans for the AES constraint rewrite rules |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/plans/ConstraintTemplateRewriteSystem.hpp [code] | Plans for the constraint rewrite system |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/plans/ConstraintTemplateSmallScaleRewriteRules.hpp [code] | Plans for the small-scale AES constraint rewrite rules |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/plans/FieldOperationsAnalysis.hpp [code] | Plans for the cryptanalysis of the Rijndael field operations |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/plans/general.hpp [code] | Plans for the cryptanalysis of Rijndael in Maxima/Lisp |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/plans/milestones.hpp [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/plans/SboxAnalysis.hpp [code] | Plans for the Cryptanalysis of the Rijndael Sbox in Maxima/Lisp |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/plans/Translations.hpp [code] | Plans for the translation of Rijndael into active clauses ("SAT constraints") etc in Maxima |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/testobjects/ConstraintTemplateGlobalPropagation.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/testobjects/ConstraintTemplateRewriteRules.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/testobjects/ConstraintTemplateRewriteSystem.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/testobjects/ConstraintTemplateSmallScaleRewriteRules.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/testobjects/ConstraintTemplateTranslation.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/testobjects/FieldOperationsAnalysis.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/testobjects/SboxAnalysis.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/testobjects/Translations.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/tests/ConstraintTemplateGlobalPropagation.mac [code] | Tests for the AES propagation functions |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/tests/ConstraintTemplateRewriteRules.mac [code] | Tests for the AES constraint template translation functions |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/tests/ConstraintTemplateRewriteSystem.mac [code] | Tests for the AES constraint template rewrite system |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/tests/ConstraintTemplateSmallScaleRewriteRules.mac [code] | Tests for the small-scale AES constraint template translation functions |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/tests/ConstraintTemplateTranslation.mac [code] | Tests for the AES propagation functions |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/tests/FieldOperationsAnalysis.mac [code] | Tests for the analysis functions of the AES Field Operations |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/tests/SboxAnalysis.mac [code] | Tests for the analysis functions of the AES Sbox |
ComputerAlgebra/Cryptology/Lisp/Cryptanalysis/Rijndael/tests/Translations.mac [code] | Tests for the AES translation functions |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/include.mac [code] | Inclusion of Maxima cryptosystem-functions |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/IteratedBlockCipher.mac [code] | General structures regarding iterated block cipher |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/Cipher.mac [code] | DES encryption and decryption |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/include.mac [code] | Inclusion of DES crypto-system |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/KeySchedule.mac [code] | The 16 round keys of DES |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/RoundFunction.mac [code] | The round function of DES |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/Sboxes.mac [code] | The 8 S-boxes of DES |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/plans/general.hpp [code] | Plans for the Data Encryption Standard crypto-system in Maxima/Lisp |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/plans/milestones.hpp [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/testobjects/Cipher.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/testobjects/KeySchedule.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/testobjects/RoundFunction.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/testobjects/Sboxes.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/tests/Cipher.mac [code] | Tests regarding the DES cipher |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/tests/KeySchedule.mac [code] | Tests regarding the DES key schedule |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/tests/RoundFunction.mac [code] | Tests regarding the DES round function |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/DataEncryptionStandard/tests/Sboxes.mac [code] | Tests regarding the DES Sboxes |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/KeeLoq/Cipher.mac [code] | The KeeLoq cipher |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/KeeLoq/include.mac [code] | Inclusion of KeeLoq crypto-system |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/KeeLoq/plans/general.hpp [code] | Plans for the KeeLoq crypto-system in Maxima/Lisp |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/KeeLoq/testobjects/Cipher.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/KeeLoq/tests/Cipher.mac [code] | Tests regarding the KeeLoq cipher |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/plans/general.hpp [code] | Plans for crypto-systems in Maxima/Lisp |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/plans/milestones.hpp [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/AdvancedEncryptionStandard.mac [code] | Implementing AES (Rijndael) and generalisations |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/BitField.mac [code] | Components for the Rijndael bit field (a field with 2^1 elements) |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/Block.mac [code] | Components for the Rijndael key and message blocks |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/ByteField.mac [code] | Components for the Rijndael byte field (a field with 2^8 elements) |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/include.mac [code] | Inclusion of Maxima Rijndael-functions |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/SmallScaleAdvancedEncryptionStandard.mac [code] | Implementing the small-scale variation of AES, and generalisations |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/SmallScaleWordFields.mac [code] | Components for the finite fields associated with the small scale AES words |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/data/FieldMultiplications.mac [code] | Rijndael's field multiplication data |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/data/InvSbox.mac [code] | Rijndael's raw inverse sbox definition |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/data/Sbox.mac [code] | Rijndael's raw sbox definition |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/docus/AdvancedEncryptionStandard.hpp [code] | User documentation for the Maxima computer algebra system implementation of the AES block cipher |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/docus/SmallScaleAdvancedEncryptionStandard.hpp [code] | User documentation for the Maxima computer algebra system implementation of the small-scale AES block cipher |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/plans/AdvancedEncryptionStandard.hpp [code] | Plans on the AES implementation |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/plans/general.hpp [code] | Plans for the Rijndael crypto system in Maxima/Lisp |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/plans/milestones.hpp [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/plans/SmallScaleAdvancedEncryptionStandard.hpp [code] | Plans on the AES implementation |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/testobjects/AdvancedEncryptionStandard.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/testobjects/Block.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/testobjects/ByteField.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/testobjects/SmallScaleAdvancedEncryptionStandard.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/testobjects/SmallScaleWordFields.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/tests/AdvancedEncryptionStandard.mac [code] | Tests for Advanced Encryption Standard |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/tests/Block.mac [code] | Tests for Advanced Encryption Standard |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/tests/ByteField.mac [code] | Tests for Advanced Encryption Standard |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/tests/SmallScaleAdvancedEncryptionStandard.mac [code] | Tests for small scale Advanced Encryption Standard |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/Rijndael/tests/SmallScaleWordFields.mac [code] | Tests for small scale Advanced Encryption Standard word fields |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/testobjects/IteratedBlockCipher.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/CryptoSystems/tests/IteratedBlockCipher.mac [code] | Tests regarding iterated block ciphers (in general) |
ComputerAlgebra/Cryptology/Lisp/plans/general.hpp [code] | Plans for cryptological tools realised in Maxima/Lisp |
ComputerAlgebra/Cryptology/Lisp/plans/milestones.hpp [code] | |
ComputerAlgebra/Cryptology/Lisp/testobjects/Conversions.mac [code] | |
ComputerAlgebra/Cryptology/Lisp/tests/Conversions.mac [code] | Tests for the Cryptology conversion functions |
ComputerAlgebra/Cryptology/plans/general.hpp [code] | Plans for cryptological tools realised in the computer algebra system |
ComputerAlgebra/Cryptology/plans/milestones.hpp [code] | |
ComputerAlgebra/Cryptology/plans/Rijndael.hpp [code] | Plans for cryptological tools regarding the Rijndael cipher |
ComputerAlgebra/DataStructures/Lisp/HashMaps.mac [code] | Functions for handling hash maps (in Maxima/Lisp) |
ComputerAlgebra/DataStructures/Lisp/include.mac [code] | Inclusion file for Maxima data-structure functions |
ComputerAlgebra/DataStructures/Lisp/Lambda.mac [code] | Functions for handling lambda-terms |
ComputerAlgebra/DataStructures/Lisp/Lists.mac [code] | Functions for handling lists (in Maxima/Lisp) |
ComputerAlgebra/DataStructures/Lisp/Strings.mac [code] | Functions for string handling and printing |
ComputerAlgebra/DataStructures/Lisp/plans/general.hpp [code] | Plans for Maxima-components regarding data structures |
ComputerAlgebra/DataStructures/Lisp/plans/HashMaps.hpp [code] | Plans for Maxima-components regarding maps |
ComputerAlgebra/DataStructures/Lisp/plans/Lists.hpp [code] | Plans for Maxima-components regarding operations on lists |
ComputerAlgebra/DataStructures/Lisp/testobjects/HashMaps.mac [code] | |
ComputerAlgebra/DataStructures/Lisp/testobjects/Lists.mac [code] | |
ComputerAlgebra/DataStructures/Lisp/testobjects/Strings.mac [code] | |
ComputerAlgebra/DataStructures/Lisp/tests/HashMaps.mac [code] | Tests for hash-processing functions |
ComputerAlgebra/DataStructures/Lisp/tests/Lists.mac [code] | Tests for list-processing functions |
ComputerAlgebra/DataStructures/Lisp/tests/Strings.mac [code] | Tests for list-processing functions |
ComputerAlgebra/docus/general.hpp [code] | Central docus-file regarding computer algebra |
ComputerAlgebra/docus/Maxima.hpp [code] | Central docus-file regarding Maxima/Lisp |
ComputerAlgebra/docus/MaximaTechniques.hpp [code] | Documentation on how to write programs in Maxima/Lisp |
ComputerAlgebra/docus/MaximaTutorial.hpp [code] | Tutorial Maxima/Lisp |
ComputerAlgebra/docus/CourseCombinatorics_LintWilson/Chapter01.hpp [code] | Chapter "Graphs" from [A Course in Combinatorics] |
ComputerAlgebra/docus/CourseCombinatorics_LintWilson/Chapter02.hpp [code] | Chapter "Trees" from [A Course in Combinatorics] |
ComputerAlgebra/docus/CourseCombinatorics_LintWilson/Chapter03.hpp [code] | Chapter "Colorings of graphs and Ramsey's theorem" from [A Course in Combinatorics] |
ComputerAlgebra/docus/CourseCombinatorics_LintWilson/Chapter21.hpp [code] | Chapter "Strongly regular graphs and partial geometries" from [A Course in Combinatorics] |
ComputerAlgebra/docus/CourseCombinatorics_LintWilson/Chapter30.hpp [code] | Chapter "Association schemes" from [A Course in Combinatorics] |
ComputerAlgebra/docus/CourseCombinatorics_LintWilson/index.hpp [code] | Main page for the tutorial based on [A Course in Combinatoris; Second Edition, J.H. van Lint and R.M. Wilson] |
ComputerAlgebra/FuzzySets/Lisp/plans/general.hpp [code] | Plans in general for fuzzy sets in Maxima/Lisp |
ComputerAlgebra/Games/Lisp/plans/general.hpp [code] | General plans regarding games |
ComputerAlgebra/Games/Lisp/plans/SimpleGraphGames.hpp [code] | Plans regarding so-called "simple graph games" |
ComputerAlgebra/Graphs/Lisp/Basic.mac [code] | Basic graph functionality |
ComputerAlgebra/Graphs/Lisp/Colouring.mac [code] | Functions for computing with independent sets in graphs |
ComputerAlgebra/Graphs/Lisp/Connectedness.mac [code] | Functions regarding connectness in graphs |
ComputerAlgebra/Graphs/Lisp/Drawing.mac [code] | Functions for drawing graphs |
ComputerAlgebra/Graphs/Lisp/Generators.mac [code] | Maxima graph generators |
ComputerAlgebra/Graphs/Lisp/include.mac [code] | Inclusion file for Maxima graph functions |
ComputerAlgebra/Graphs/Lisp/IndependentSets.mac [code] | Functions for computing with independent sets in graphs |
ComputerAlgebra/Graphs/Lisp/InputOutput.mac [code] | Maxima graph input and output |
ComputerAlgebra/Graphs/Lisp/Statistics.mac [code] | Graph statistics |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/BasicNotions.mac [code] | Functions regarding biclique partitions in multigraphs |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/Heuristics.mac [code] | Finding biclique partitions by heuristical algorithms |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/include.mac [code] | Inclusion file for functions related to biclique partitions |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/plans/BasicNotions.hpp [code] | Plans regarding notions of biclique partitions in (general) graphs |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/plans/Enumeration.hpp [code] | Plans regarding enumeration of all biclique partitions in (general) graphs |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/plans/general.hpp [code] | Plans regarding biclique partitions of (general) graphs |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/plans/milestones.hpp [code] | |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/plans/Sampling.hpp [code] | Plans regarding sampling of biclique partitions in (general) graphs |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/plans/Search.hpp [code] | Plans regarding searching for (special) biclique partitions |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/plans/Transformations.hpp [code] | Plans regarding transforming the problem of finding biclique partitions into other problems |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/testobjects/BasicNotions.mac [code] | |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/testobjects/Heuristics.mac [code] | |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/tests/BasicNotions.mac [code] | Tests for biclique-notions |
ComputerAlgebra/Graphs/Lisp/BicliquePartitions/tests/Heuristics.mac [code] | Tests for heuristical approaches for finding biclique partitions |
ComputerAlgebra/Graphs/Lisp/Bicliques/BasicNotions.mac [code] | Functions regarding biclique in multigraphs |
ComputerAlgebra/Graphs/Lisp/Bicliques/Consensus.mac [code] | Consensus method functions regarding generating maximal bicliques in multigraphs |
ComputerAlgebra/Graphs/Lisp/Bicliques/include.mac [code] | Inclusion file for functions related to bicliques |
ComputerAlgebra/Graphs/Lisp/Bicliques/plans/BasicNotions.hpp [code] | Plans regarding notions of bicliques |
ComputerAlgebra/Graphs/Lisp/Bicliques/plans/Consensus.hpp [code] | Plans regarding implementing the "consensus algorithm" from [XXX] for computing all maximal bicliques |
ComputerAlgebra/Graphs/Lisp/Bicliques/plans/general.hpp [code] | Plans regarding bicliques of (general) graphs |
ComputerAlgebra/Graphs/Lisp/Bicliques/plans/milestones.hpp [code] | |
ComputerAlgebra/Graphs/Lisp/Bicliques/plans/Sampling.hpp [code] | Plans regarding sampling of biclique partitions in (general) graphs |
ComputerAlgebra/Graphs/Lisp/Bicliques/testobjects/BasicNotions.mac [code] | |
ComputerAlgebra/Graphs/Lisp/Bicliques/testobjects/Consensus.mac [code] | |
ComputerAlgebra/Graphs/Lisp/Bicliques/tests/BasicNotions.mac [code] | Tests for biclique-notions |
ComputerAlgebra/Graphs/Lisp/Bicliques/tests/Consensus.mac [code] | |
ComputerAlgebra/Graphs/Lisp/docus/general.hpp [code] | User documentation for graphs in Lisp/Maxima |
ComputerAlgebra/Graphs/Lisp/docus/Tutorial.hpp [code] | Tutorial on graphs in Maxima/Lisp by MH |
ComputerAlgebra/Graphs/Lisp/Isomorphisms/Homomorphisms.mac [code] | Functions for checking and finding graph homomorphisms |
ComputerAlgebra/Graphs/Lisp/Isomorphisms/include.mac [code] | Inclusion file for graph isomorphism functions |
ComputerAlgebra/Graphs/Lisp/Isomorphisms/plans/general.hpp [code] | Plans regarding graph isomorphisms |
ComputerAlgebra/Graphs/Lisp/Isomorphisms/plans/Homomorphisms.hpp [code] | Plans regarding graph homomorphisms in general |
ComputerAlgebra/Graphs/Lisp/Isomorphisms/testobjects/Homomorphisms.mac [code] | |
ComputerAlgebra/Graphs/Lisp/Isomorphisms/tests/Homomorphisms.mac [code] | Tests for basic graph functionality |
ComputerAlgebra/Graphs/Lisp/plans/Basic.hpp [code] | Plans on the basic graph functionality |
ComputerAlgebra/Graphs/Lisp/plans/Colouring.hpp [code] | Plans for graph colouring |
ComputerAlgebra/Graphs/Lisp/plans/general.hpp [code] | Plans for graphs in Maxima/Lisp |
ComputerAlgebra/Graphs/Lisp/plans/Generators.hpp [code] | Plans regarding generation of combinatorial graphs |
ComputerAlgebra/Graphs/Lisp/plans/InputOutput.hpp [code] | Plans regarding input and output of graphs in Maxima/Lisp |
ComputerAlgebra/Graphs/Lisp/plans/milestones.hpp [code] | |
ComputerAlgebra/Graphs/Lisp/plans/RandomGraphs.hpp [code] | Plans regarding generation of (general) random graphs |
ComputerAlgebra/Graphs/Lisp/plans/Statistics.hpp [code] | Plans regarding basic statistics for (general) graphs |
ComputerAlgebra/Graphs/Lisp/StrongRegularity/plans/general.hpp [code] | Plans on strongly regular graphs |
ComputerAlgebra/Graphs/Lisp/testobjects/Basic.mac [code] | |
ComputerAlgebra/Graphs/Lisp/testobjects/Colouring.mac [code] | |
ComputerAlgebra/Graphs/Lisp/testobjects/Connectedness.mac [code] | |
ComputerAlgebra/Graphs/Lisp/testobjects/Generators.mac [code] | |
ComputerAlgebra/Graphs/Lisp/testobjects/IndependentSets.mac [code] | |
ComputerAlgebra/Graphs/Lisp/testobjects/Statistics.mac [code] | |
ComputerAlgebra/Graphs/Lisp/tests/Basic.mac [code] | Tests for basic graph functionality |
ComputerAlgebra/Graphs/Lisp/tests/Colouring.mac [code] | Tests for graph-colouring functions |
ComputerAlgebra/Graphs/Lisp/tests/Connectedness.mac [code] | |
ComputerAlgebra/Graphs/Lisp/tests/Generators.mac [code] | Tests for basic graph functionality |
ComputerAlgebra/Graphs/Lisp/tests/IndependentSets.mac [code] | Tests for graph- and hypergraph-functionality regarding clause-sets |
ComputerAlgebra/Graphs/Lisp/tests/Statistics.mac [code] | Tests for graph statistics |
ComputerAlgebra/Graphs/Lisp/Trees/Generators.mac [code] | Tree generators |
ComputerAlgebra/Graphs/Lisp/Trees/include.mac [code] | Inclusion file for functions related to trees (as combinatorial objects) |
ComputerAlgebra/Graphs/Lisp/Trees/Representations.mac [code] | Creating and using tree representations |
ComputerAlgebra/Graphs/Lisp/Trees/plans/general.hpp [code] | Plans regarding trees (as combinatorial objects) |
ComputerAlgebra/Graphs/Lisp/Trees/plans/Generators.hpp [code] | Plans for the generation of various forms of trees |
ComputerAlgebra/Graphs/Lisp/Trees/plans/Representations.hpp [code] | Plans regarding the creation and usage of tree representations |
ComputerAlgebra/Graphs/Lisp/Trees/testobjects/Generators.mac [code] | |
ComputerAlgebra/Graphs/Lisp/Trees/testobjects/Representations.mac [code] | |
ComputerAlgebra/Graphs/Lisp/Trees/tests/Generators.mac [code] | Tests for basic graph functionality |
ComputerAlgebra/Graphs/Lisp/Trees/tests/Representations.mac [code] | Tests for tree representations and encodings |
ComputerAlgebra/Hypergraphs/Lisp/Basics.mac [code] | Basic Maxima functions for hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Colouring.mac [code] | Functions related to colouring of hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Homomorphisms.mac [code] | Functions related to homomorphisms of hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/include.mac [code] | Inclusion file for Maxima hypergraph functions |
ComputerAlgebra/Hypergraphs/Lisp/IndependentSets.mac [code] | Functions for independent sets in hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/SetSystems.mac [code] | Maxima functions for handling of set systems |
ComputerAlgebra/Hypergraphs/Lisp/Statistics.mac [code] | Statistics for hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Stratification.mac [code] | Basic Maxima functions for hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/Gasarch.mac [code] | Maxima functions for generating Gasarch hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/Generators.mac [code] | Maxima functions for generating hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/GreenTao.mac [code] | Maxima functions for generating Green-Tao hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/Hindman.mac [code] | Maxima functions for generating Hindman hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/include.mac [code] | Inclusion file for Maxima hypergraph generators |
ComputerAlgebra/Hypergraphs/Lisp/Generators/Rado.mac [code] | Maxima functions for generating Rado hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/Ramsey.mac [code] | Maxima functions for generating Ramsey-hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/Schur.mac [code] | Maxima functions for generating Schur-hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/VanderWaerden.mac [code] | Tools related to the generation of hypergraphs of arithmetic progressions |
ComputerAlgebra/Hypergraphs/Lisp/Generators/plans/Gasarch.hpp [code] | Plans regarding generators for Gasarch hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/plans/general.hpp [code] | Plans regarding generators for hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/plans/GreenTao.hpp [code] | Plans regarding generators for Green-Tao hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/plans/Hindman.hpp [code] | Plans regarding hypergraphs generators related to Hindman's theorems and conjectures |
ComputerAlgebra/Hypergraphs/Lisp/Generators/plans/milestones.hpp [code] | |
ComputerAlgebra/Hypergraphs/Lisp/Generators/plans/Rado.hpp [code] | Plans regarding hypergraphs generators related to Rado's theorems |
ComputerAlgebra/Hypergraphs/Lisp/Generators/plans/Ramsey.hpp [code] | Plans regarding generators for Ramsey-hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/plans/VanderWaerden.hpp [code] | Plans regarding generators for vdW-hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/Generators/testobjects/Gasarch.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/Generators/testobjects/Generators.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/Generators/testobjects/GreenTao.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/Generators/testobjects/Hindman.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/Generators/testobjects/Ramsey.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/Generators/testobjects/Schur.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/Generators/testobjects/VanderWaerden.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/Generators/tests/Gasarch.mac [code] | Tests for Gasarch hypergraph generators |
ComputerAlgebra/Hypergraphs/Lisp/Generators/tests/Generators.mac [code] | Tests for hypergraph generators |
ComputerAlgebra/Hypergraphs/Lisp/Generators/tests/GreenTao.mac [code] | Tests for Green-Tao hypergraph generators |
ComputerAlgebra/Hypergraphs/Lisp/Generators/tests/Hindman.mac [code] | Tests for hypergraph generators related to Hindman's theorem |
ComputerAlgebra/Hypergraphs/Lisp/Generators/tests/Ramsey.mac [code] | Tests for hypergraph generators |
ComputerAlgebra/Hypergraphs/Lisp/Generators/tests/Schur.mac [code] | Tests for Schur-hypergraph generators |
ComputerAlgebra/Hypergraphs/Lisp/Generators/tests/VanderWaerden.mac [code] | Tests for generation tools related to hypergraphs of arithmetic progressions |
ComputerAlgebra/Hypergraphs/Lisp/plans/Basics.hpp [code] | Plans regarding the basic notions for hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/plans/Colouring.hpp [code] | Plans regarding (various) colouring problems for hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/plans/general.hpp [code] | Plans for Maxima-components for hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/plans/milestones.hpp [code] | |
ComputerAlgebra/Hypergraphs/Lisp/plans/SetSystems.hpp [code] | Plans for Maxima-components for systems of sets |
ComputerAlgebra/Hypergraphs/Lisp/testobjects/Basics.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/testobjects/Colouring.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/testobjects/Homomorphisms.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/testobjects/IndependentSets.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/testobjects/SetSystems.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/testobjects/Statistics.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/testobjects/Stratification.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/tests/Basics.mac [code] | Tests for basic hypergraph functions |
ComputerAlgebra/Hypergraphs/Lisp/tests/Colouring.mac [code] | Tests for colouring-related functions |
ComputerAlgebra/Hypergraphs/Lisp/tests/Homomorphisms.mac [code] | Tests for homomorphisms-related functions |
ComputerAlgebra/Hypergraphs/Lisp/tests/IndependentSets.mac [code] | Tests for independence-hypergraphs |
ComputerAlgebra/Hypergraphs/Lisp/tests/SetSystems.mac [code] | Tests regarding set-system functions |
ComputerAlgebra/Hypergraphs/Lisp/tests/Statistics.mac [code] | Tests for hypergraph statistics functions |
ComputerAlgebra/Hypergraphs/Lisp/tests/Stratification.mac [code] | Tests for functions related to stratification |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/Basics.mac [code] | Basic functions for hypergraph transversals |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/include.mac [code] | Inclusion file for hypergraph transversal functions |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/Bounded/include.mac [code] | Inclusion file for functionality regarding bounded transversals |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/Bounded/MaintainingBound.mac [code] | Computing size-bounded transversals "from below" (starting with the empty set) |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/Bounded/plans/general.hpp [code] | Plans regarding finding size-bounded hypergraph transversals |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/Bounded/testobjects/MaintainingBound.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/Bounded/tests/MaintainingBound.mac [code] | Tests for finding transversals "from below" |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/Minimal/include.mac [code] | Inclusion file for functions regarding minimal transversals |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/Minimal/RecursiveSplitting.mac [code] | Functions for finding hypergraph transversals by Berge's algorithm |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/Minimal/plans/general.hpp [code] | Plans regarding finding minimal hypergraph transversals |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/Minimal/testobjects/RecursiveSplitting.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/Minimal/tests/RecursiveSplitting.mac [code] | Tests regarding Berge's basic algorithm |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/plans/general.hpp [code] | Plans regarding hypergraphs transversals (in Maxima/Lisp) |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/testobjects/Basics.mac [code] | |
ComputerAlgebra/Hypergraphs/Lisp/Transversals/tests/Basics.mac [code] | Tests for basic transversal-functions |
ComputerAlgebra/IncidenceStructures/Lisp/BasicNotions.mac [code] | Basic notions for incidence structures |
ComputerAlgebra/IncidenceStructures/Lisp/include.mac [code] | Inclusion file for Maxima functions related to incidence structures |
ComputerAlgebra/IncidenceStructures/Lisp/ProjectivePlanes.mac [code] | Basic notions for incidence structures |
ComputerAlgebra/IncidenceStructures/Lisp/plans/general.hpp [code] | Plans on incidence structures in general |
ComputerAlgebra/IncidenceStructures/Lisp/plans/ProjectivePlanes.hpp [code] | Plans on projective incidence planes |
ComputerAlgebra/LinearAlgebra/Lisp/include.mac [code] | Inclusion file for Maxima linear algebra functions |
ComputerAlgebra/LinearAlgebra/Lisp/QuadraticForms.mac [code] | Maxima functions regarding quadratic forms and symmetric bilinear forms |
ComputerAlgebra/LinearAlgebra/Lisp/demos/QuadraticForms.dem [code] | |
ComputerAlgebra/LinearAlgebra/Lisp/docus/general.hpp [code] | User documentation for linear algebra (SAT-related in a wider sense) in Lisp/Maxima |
ComputerAlgebra/LinearAlgebra/Lisp/plans/general.hpp [code] | Plans on linear algebra in Maxima |
ComputerAlgebra/LinearAlgebra/Lisp/testobjects/QuadraticForms.mac [code] | |
ComputerAlgebra/LinearAlgebra/Lisp/tests/QuadraticForms.mac [code] | Tests for splitting trees |
ComputerAlgebra/LogicalDataAnalysis/Lisp/plans/general.hpp [code] | General plans regarding the logical analysis of data |
ComputerAlgebra/Matroids/Lisp/Basics.mac [code] | Basic functionality related to matroids |
ComputerAlgebra/Matroids/Lisp/include.mac [code] | Inclusion file for Maxima functions related to matroids |
ComputerAlgebra/Matroids/Lisp/Greedoids/Basics.mac [code] | Basic functionality related to greedoids |
ComputerAlgebra/Matroids/Lisp/Greedoids/include.mac [code] | Inclusion file for Maxima functions related to greedoids |
ComputerAlgebra/Matroids/Lisp/Greedoids/plans/general.hpp [code] | General plans regarding greedoids |
ComputerAlgebra/Matroids/Lisp/Greedoids/testobjects/Basics.mac [code] | Tests for basic greedoid functions |
ComputerAlgebra/Matroids/Lisp/Greedoids/tests/Basics.mac [code] | Tests for basic matroid functions |
ComputerAlgebra/Matroids/Lisp/OrientedMatroids/include.mac [code] | Inclusion file for Maxima functions related to oriented matroids |
ComputerAlgebra/Matroids/Lisp/OrientedMatroids/SignVectors.mac [code] | Tools for handling sign vectors |
ComputerAlgebra/Matroids/Lisp/OrientedMatroids/plans/general.hpp [code] | Plans regarding oriented matroids in Maxima/Lisp |
ComputerAlgebra/Matroids/Lisp/plans/general.hpp [code] | Plans regarding matroids in Maxima/Lisp |
ComputerAlgebra/Matroids/Lisp/testobjects/Basics.mac [code] | Tests for basic matroid functions |
ComputerAlgebra/Matroids/Lisp/tests/Basics.mac [code] | Tests for basic matroid functions |
ComputerAlgebra/Matroids/plans/general.hpp [code] | General plans regarding matroids |
ComputerAlgebra/MaximaInternals/Auxiliary.mac [code] | Various functions helping to handle Maxima specialities |
ComputerAlgebra/MaximaInternals/include.mac [code] | Central inclusion file for Maxima functions helping to handle Maxima specialities |
ComputerAlgebra/MaximaInternals/MemoryManagement.mac [code] | Handling memory limits |
ComputerAlgebra/MaximaInternals/plans/general.hpp [code] | General plans regarding internals of Maxima |
ComputerAlgebra/MaximaInternals/plans/MemoryManagement.hpp [code] | Plans on improved memory managenemt |
ComputerAlgebra/MaximaInternals/testobjects/Auxiliary.mac [code] | |
ComputerAlgebra/MaximaInternals/tests/Auxiliary.mac [code] | Tests for functions helping to handle Maxima specialities |
ComputerAlgebra/Mupad/plans/general.hpp [code] | Plans for the (deprecated) Mupad-module |
ComputerAlgebra/Mupad/plans/milestones.hpp [code] | |
ComputerAlgebra/NumberTheory/Lisp/Auxiliary.mac [code] | Functions for number theory functions which more or less augment/correct Maxima functions |
ComputerAlgebra/NumberTheory/Lisp/CalkinWilf.mac [code] | Functions related to the Calkin-Wilf enumeration of the positive rational numbers |
ComputerAlgebra/NumberTheory/Lisp/Collatz.mac [code] | Functions related to the Collatz conjecture |
ComputerAlgebra/NumberTheory/Lisp/include.mac [code] | Inclusion file for Maxima number theory functions |
ComputerAlgebra/NumberTheory/Lisp/ModularArithmetic.mac [code] | Functions for number theory functions related to modular arithmetic |
ComputerAlgebra/NumberTheory/Lisp/PrimeNumbers.mac [code] | Functions related to prime numbers |
ComputerAlgebra/NumberTheory/Lisp/Quadratics.mac [code] | Around quadratic functions |
ComputerAlgebra/NumberTheory/Lisp/SurrealNumbers.mac [code] | Functions related to surreal numbers |
ComputerAlgebra/NumberTheory/Lisp/plans/Auxiliary.hpp [code] | Plans regarding helper functions with number-theoretical character |
ComputerAlgebra/NumberTheory/Lisp/plans/general.hpp [code] | General plans for number theory in the Maxima computer algebra system |
ComputerAlgebra/NumberTheory/Lisp/plans/milestones.hpp [code] | |
ComputerAlgebra/NumberTheory/Lisp/plans/PrimeNumbers.hpp [code] | Plans regarding prime numbers |
ComputerAlgebra/NumberTheory/Lisp/plans/Quadratics.hpp [code] | Plans regarding quadratic functions |
ComputerAlgebra/NumberTheory/Lisp/testobjects/Auxiliary.mac [code] | |
ComputerAlgebra/NumberTheory/Lisp/testobjects/CalkinWilf.mac [code] | |
ComputerAlgebra/NumberTheory/Lisp/testobjects/Collatz.mac [code] | |
ComputerAlgebra/NumberTheory/Lisp/testobjects/ModularArithmetic.mac [code] | |
ComputerAlgebra/NumberTheory/Lisp/testobjects/PrimeNumbers.mac [code] | |
ComputerAlgebra/NumberTheory/Lisp/testobjects/Quadratics.mac [code] | |
ComputerAlgebra/NumberTheory/Lisp/testobjects/SurrealNumbers.mac [code] | |
ComputerAlgebra/NumberTheory/Lisp/tests/Auxiliary.mac [code] | Tests for auxiliary number theory functions |
ComputerAlgebra/NumberTheory/Lisp/tests/CalkinWilf.mac [code] | Tests for auxiliary number theory functions |
ComputerAlgebra/NumberTheory/Lisp/tests/Collatz.mac [code] | Tests for auxiliary number theory functions |
ComputerAlgebra/NumberTheory/Lisp/tests/ModularArithmetic.mac [code] | Tests for auxiliary number theory functions |
ComputerAlgebra/NumberTheory/Lisp/tests/PrimeNumbers.mac [code] | Tests for auxiliary number theory functions |
ComputerAlgebra/NumberTheory/Lisp/tests/Quadratics.mac [code] | Tests for auxiliary number theory functions |
ComputerAlgebra/NumberTheory/Lisp/tests/SurrealNumbers.mac [code] | Tests regarding surreal numbers |
ComputerAlgebra/Numerical/Lisp/include.mac [code] | Inclusion file for Maxima functions related to numerical computations |
ComputerAlgebra/Numerical/Lisp/LinearProgramming.mac [code] | Functions regarding linear programming |
ComputerAlgebra/Numerical/Lisp/Minimisation.mac [code] | Minimisation of arbitrary functions |
ComputerAlgebra/Numerical/Lisp/Norms.mac [code] | Vector and matrix norms |
ComputerAlgebra/Numerical/Lisp/plans/general.hpp [code] | Plans for numerical Maxima/Lisp functions in general |
ComputerAlgebra/Numerical/Lisp/plans/LinearProgramming.hpp [code] | Plans for numerical linear programming tools |
ComputerAlgebra/Numerical/Lisp/testobjects/LinearProgramming.mac [code] | |
ComputerAlgebra/Numerical/Lisp/testobjects/Norms.mac [code] | |
ComputerAlgebra/Numerical/Lisp/tests/LinearProgramming.mac [code] | Tests for list-processing functions |
ComputerAlgebra/Numerical/Lisp/tests/Norms.mac [code] | Tests for vector/matrix norms |
ComputerAlgebra/plans/Axiom.hpp [code] | General plans regarding the computer algebra system Axiom (and SAT) |
ComputerAlgebra/plans/GAP.hpp [code] | |
ComputerAlgebra/plans/general.hpp [code] | |
ComputerAlgebra/plans/Maxima.hpp [code] | General plans regarding the Maxima computer algebra system |
ComputerAlgebra/plans/MaximaTechniques.hpp [code] | |
ComputerAlgebra/plans/milestones.hpp [code] | |
ComputerAlgebra/RamseyTheory/include.mac [code] | Inclusion file for Ramsey Theory functions |
ComputerAlgebra/RamseyTheory/Lisp/include.mac [code] | Inclusion file for Maxima Ramsey theory functions |
ComputerAlgebra/RamseyTheory/Lisp/Sequences.mac [code] | Tools for manipulating sequences of numbers as relevant for Ramsey theory |
ComputerAlgebra/RamseyTheory/Lisp/GreenTao/Asymptotics.mac [code] | Asymptotic computations in the context of Green-Tao numbers |
ComputerAlgebra/RamseyTheory/Lisp/GreenTao/include.mac [code] | Inclusion file for functions related to Green-Tao numbers |
ComputerAlgebra/RamseyTheory/Lisp/GreenTao/Numbers.mac [code] | Handling of Green-Tao numbers |
ComputerAlgebra/RamseyTheory/Lisp/GreenTao/plans/Asymptotics.hpp [code] | Plans regarding asymptotic estimations |
ComputerAlgebra/RamseyTheory/Lisp/GreenTao/plans/general.hpp [code] | Plans regarding Green-Tao problems |
ComputerAlgebra/RamseyTheory/Lisp/GreenTao/plans/Numbers.hpp [code] | Plans regarding Green-Tao numbers |
ComputerAlgebra/RamseyTheory/Lisp/GreenTao/testobjects/Asymptotics.mac [code] | |
ComputerAlgebra/RamseyTheory/Lisp/GreenTao/testobjects/Numbers.mac [code] | |
ComputerAlgebra/RamseyTheory/Lisp/GreenTao/tests/Asymptotics.mac [code] | Tests for functions related to asymptotic estimations |
ComputerAlgebra/RamseyTheory/Lisp/GreenTao/tests/Numbers.mac [code] | Tests for functions related to GT-numbers |
ComputerAlgebra/RamseyTheory/Lisp/plans/general.hpp [code] | Plans regarding Ramsey-type problems in general |
ComputerAlgebra/RamseyTheory/Lisp/plans/Sequences.hpp [code] | Plans regarding general tools for sequences occurring in Ramsey theory |
ComputerAlgebra/RamseyTheory/Lisp/Ramsey/Hypergraphs.mac [code] | Basic functions for investigating Ramsey hypergraphs |
ComputerAlgebra/RamseyTheory/Lisp/Ramsey/include.mac [code] | Inclusion file for Maxima Ramsey functions |
ComputerAlgebra/RamseyTheory/Lisp/Ramsey/Numbers.mac [code] | Providing access to all known information on Ramsey numbers |
ComputerAlgebra/RamseyTheory/Lisp/Ramsey/plans/general.hpp [code] | Plans regarding Ramsey problems |
ComputerAlgebra/RamseyTheory/Lisp/Ramsey/plans/Numbers.hpp [code] | Plans regarding Ramsey numbers |
ComputerAlgebra/RamseyTheory/Lisp/Ramsey/testobjects/Numbers.mac [code] | |
ComputerAlgebra/RamseyTheory/Lisp/Ramsey/tests/Numbers.mac [code] | Tests for functions computing Ramsey-numbers |
ComputerAlgebra/RamseyTheory/Lisp/Schur/Certificates.mac [code] | Functions for investigating certificates of Schur-lower-bounds |
ComputerAlgebra/RamseyTheory/Lisp/Schur/Homomorphisms.mac [code] | Homomorphisms related to Schur-hypergraphs |
ComputerAlgebra/RamseyTheory/Lisp/Schur/include.mac [code] | Inclusion file for Maxima Schur-related functions |
ComputerAlgebra/RamseyTheory/Lisp/Schur/Numbers.mac [code] | Handling of Schur numbers |
ComputerAlgebra/RamseyTheory/Lisp/Schur/testobjects/Certificates.mac [code] | |
ComputerAlgebra/RamseyTheory/Lisp/Schur/testobjects/Homomorphisms.mac [code] | |
ComputerAlgebra/RamseyTheory/Lisp/Schur/tests/Certificates.mac [code] | Tests for functions related to certificates for Schur-problems |
ComputerAlgebra/RamseyTheory/Lisp/Schur/tests/Homomorphisms.mac [code] | Tests for functions related to certificates for Schur-problems |
ComputerAlgebra/RamseyTheory/Lisp/testobjects/Numbers.mac [code] | |
ComputerAlgebra/RamseyTheory/Lisp/testobjects/Sequences.mac [code] | |
ComputerAlgebra/RamseyTheory/Lisp/tests/Numbers.mac [code] | Tests for general functions regarding Ramsey-type numbers |
ComputerAlgebra/RamseyTheory/Lisp/tests/Sequences.mac [code] | Tests for functions handling sequences |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/Certificates.mac [code] | Functions for investigating certificates of vdW-lower-bounds |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/Constructions.mac [code] | Constructions of vdW-certificates |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/Hypergraphs.mac [code] | Basic functions for investigating Van der Waerden hypergraphs |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/include.mac [code] | Inclusion file for Maxima van-der-Waerden-related functions |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/Numbers.mac [code] | Handling of van der Waerden numbers |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/PdNumbers.mac [code] | Handling of palindromic van der Waerden numbers |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/data/3k.mac [code] | Certificates for vdw_2(3,k) |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/plans/Certificates.hpp [code] | Plans regarding van der Waerden certificates |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/plans/Constructions.hpp [code] | Plans regarding constructions of van der Waerden certificates |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/plans/general.hpp [code] | Plans regarding van der Waerden problems |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/plans/Numbers.hpp [code] | Plans regarding van der Waerden numbers |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/plans/PdNumbers.hpp [code] | Plans regarding palindromic van der Waerden numbers |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/testobjects/certificates.mac [code] | |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/testobjects/Certificates.mac [code] | |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/testobjects/Constructions.mac [code] | |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/testobjects/Hypergraphs.mac [code] | |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/testobjects/Numbers.mac [code] | |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/tests/certificates.mac [code] | Tests of certificates for vdW-problems |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/tests/Certificates.mac [code] | Tests for functions related to certificates for vdW-problems |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/tests/Constructions.mac [code] | Tests for functions related to vdW-constructions |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/tests/Hypergraphs.mac [code] | Tests for functions related to vdW-hypergraphs |
ComputerAlgebra/RamseyTheory/Lisp/VanderWaerden/tests/Numbers.mac [code] | Tests for functions related to vdW-numbers |
ComputerAlgebra/RamseyTheory/plans/general.hpp [code] | General plans regarding Ramsey theory (in computer algebra) |
ComputerAlgebra/Satisfiability/Aldor/plans/general.hpp [code] | General plans regarding SAT at the Aldor/Axiom level |
ComputerAlgebra/Satisfiability/Aldor/plans/milestones.hpp [code] | |
ComputerAlgebra/Satisfiability/Lisp/include.mac [code] | Inclusion file for Maxima satisfiability-related functions |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/AutarkyMonoid.mac [code] | Functions translating autarky-search-problems into other problems |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/include.mac [code] | Inclusion file for Maxima autarky functions |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/LargestAutarky.mac [code] | Functions related to the largest autarky in partial assignments |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/LeanKernel.mac [code] | Functions for computing lean kernels |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/LinearAutarkies.mac [code] | Functions related to linear autarkies |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/MatchingAutarkies.mac [code] | Functions related to matching autarkies |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/MinVarDegrees.mac [code] | Functions related to the minimal variable-degree of lean clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/TableauAlgorithm.mac [code] | Functions for computing lean kernels via the Tableau-algorithm |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/Translations.mac [code] | Functions translating autarky-search-problems into other problems |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/plans/AutarkyMonoid.hpp [code] | Plans regarding autarky monoids |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/plans/general.hpp [code] | Plans for Maxima-components regarding autarkies |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/plans/LeanKernel.hpp [code] | Plans regarding computations of lean kernels |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/plans/LinearAutarkies.hpp [code] | Plans for Maxima-components regarding linear autarkies |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/plans/MatchingAutarkies.hpp [code] | Plans for Maxima-components regarding matching autarkies |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/plans/TableauAlgorithm.hpp [code] | Plans regarding exploitation of tableau algorithms for finding autarkies |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/plans/Translations.hpp [code] | Plans on autarky search via translation to other problems |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/testobjects/LargestAutarky.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/testobjects/LeanKernel.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/testobjects/LinearAutarkies.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/testobjects/MatchingAutarkies.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/testobjects/MinVarDegrees.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/testobjects/TableauAlgorithm.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/testobjects/Translations.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/tests/LargestAutarky.mac [code] | Tests related to extraction of the largest autarky |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/tests/LeanKernel.mac [code] | Tests for computations of lean kernels |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/tests/LinearAutarkies.mac [code] | Tests related to extraction of the largest autarky |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/tests/MatchingAutarkies.mac [code] | Tests related to extraction of the largest autarky |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/tests/MinVarDegrees.mac [code] | Tests related to min-var-degrees of lean clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/tests/TableauAlgorithm.mac [code] | Tests for autarky search via the tableau method |
ComputerAlgebra/Satisfiability/Lisp/Autarkies/tests/Translations.mac [code] | Tests for autarky search via reductions to other problems |
ComputerAlgebra/Satisfiability/Lisp/Backdoors/plans/general.hpp [code] | Plans on backdoor-related algorithms |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/ConstraintSatisfaction.mac [code] | Functions for solving constraint satisfaction problems via backtracking |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/DLL_solvers.mac [code] | D(P)LL-like solver schemes |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/include.mac [code] | Inclusion file for Maxima backtracking-related functions |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/Learning.mac [code] | SAT algorithms mostly based on learning |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/OKsolver2002.mac [code] | Procedural specifications for the OKsolver-2002 |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/SplittingTrees.mac [code] | Functions for handling of splitting trees |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/plans/ConstraintSatisfaction.hpp [code] | Plans on (classical) backtracking techniques for constraint solving |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/plans/DLL_solvers.hpp [code] | Plans for DLL-solvers |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/plans/general.hpp [code] | Plans for Maxima-components regarding backtracking algorithms |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/plans/Learning.hpp [code] | Plans regarding (pure) learning algorithms |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/plans/OKsolver2002.hpp [code] | Plans for the Maxima/Lisp specification of the original OKsolver |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/plans/SplittingTrees.hpp [code] | Plans on finding and handling splitting trees |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/testobjects/ConstraintSatisfaction.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/testobjects/DLL_solvers.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/testobjects/Learning.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/testobjects/SplittingTrees.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/tests/ConstraintSatisfaction.mac [code] | Tests related to solving constraint problems by backtracking |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/tests/DLL_solvers.mac [code] | Tests for splitting trees |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/tests/Learning.mac [code] | Tests for (pure) learning algorithms |
ComputerAlgebra/Satisfiability/Lisp/Backtracking/tests/SplittingTrees.mac [code] | Tests for splitting trees |
ComputerAlgebra/Satisfiability/Lisp/BoundedDeficiency/plans/general.hpp [code] | Plans for algorithms handling problems of bounded deficiency (or, better, for algorithms guided by the maximal-deficiency-parameter) |
ComputerAlgebra/Satisfiability/Lisp/BranchingTuples/Basic.mac [code] | Maxima-implementations for the tau-function |
ComputerAlgebra/Satisfiability/Lisp/BranchingTuples/include.mac [code] | Inclusion file for Maxima functions related to branching tuples |
ComputerAlgebra/Satisfiability/Lisp/BranchingTuples/Trees.mac [code] | Functions regarding tree probability distributions |
ComputerAlgebra/Satisfiability/Lisp/BranchingTuples/demos/Basic.dem [code] | |
ComputerAlgebra/Satisfiability/Lisp/BranchingTuples/docus/general.hpp [code] | User documentation regarding branching tuples in Lisp/Maxima |
ComputerAlgebra/Satisfiability/Lisp/BranchingTuples/plans/general.hpp [code] | Plans regarding the tau function (see SAT-handbook article of OK) |
ComputerAlgebra/Satisfiability/Lisp/BranchingTuples/plans/milestones.hpp [code] | |
ComputerAlgebra/Satisfiability/Lisp/BranchingTuples/testobjects/Basic.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/BranchingTuples/testobjects/Trees.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/BranchingTuples/tests/Basic.mac [code] | Tests for basic operations related to the tau-function |
ComputerAlgebra/Satisfiability/Lisp/BranchingTuples/tests/Trees.mac [code] | Tests for operations connected with branching analysis of trees |
ComputerAlgebra/Satisfiability/Lisp/Categories/ClauseSets.mac [code] | The basic category of clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Categories/include.mac [code] | Inclusion file for functions related to categories of clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Categories/LiteralStructures.mac [code] | Literal structures for categories of clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Categories/plans/ClauseSets.hpp [code] | Plans regarding the category of formal clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Categories/plans/general.hpp [code] | General plans for categories of clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/BasicOperations.mac [code] | Functions for basic operations with clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/Constructions.mac [code] | Basic constructions for clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/Hypergraphs.mac [code] | Functions related to the various transformation to graphs and hypergraphs |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/include.mac [code] | Inclusion file for Maxima clause-set functions |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/NonBoolean.mac [code] | Functions for basic operations with clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/PartialAssignments.mac [code] | Basic operations for partial assignments |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/Statistics.mac [code] | Functions for basic statistics for clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/Substitutions.mac [code] | Applying substitutions to literals, clauses and clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/plans/Constructions.hpp [code] | Plans for basic clause-set constructions |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/plans/general.hpp [code] | Plans for Maxima-components regarding clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/plans/Hypergraphs.hpp [code] | Plans regarding graphs and hypergraph constructions from clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/plans/NonBoolean.hpp [code] | Plans for Maxima-components regarding generalised clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/plans/Statistics.hpp [code] | Plans regarding statistics for clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/plans/Substitutions.hpp [code] | Plans regarding substitutions for clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/testobjects/BasicOperations.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/testobjects/Constructions.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/testobjects/Hypergraphs.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/testobjects/NonBoolean.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/testobjects/PartialAssignments.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/testobjects/Statistics.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/testobjects/Substitutions.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/tests/BasicOperations.mac [code] | Tests for the basic operations with clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/tests/Constructions.mac [code] | Tests for the basic operations with clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/tests/Hypergraphs.mac [code] | Tests for graph- and hypergraph-functionality regarding clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/tests/NonBoolean.mac [code] | Tests for the basic operations with clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/tests/PartialAssignments.mac [code] | Tests for operations with partial assignments |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/tests/Statistics.mac [code] | Tests for the basic operations with clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ClauseSets/tests/Substitutions.mac [code] | Tests for the basic operations with clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/Conflicts.mac [code] | Functions related to the conflict-combinatorics of clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/HittingClauseSets.mac [code] | Functions related to hitting clause-sets and generalisations |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/HittingProofSystem.mac [code] | Functions related to hitting proof systems |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/include.mac [code] | Inclusion file for Maxima functions related to the conflict-combinatorics of clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/docus/general.hpp [code] | User documentation for the conflict combinatorics of SAT (in Lisp/Maxima) |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/plans/AssociativeBlockDesigns.hpp [code] | Plans related to unsatisfiable hitting clause-sets which are uniform and variable-regular |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/plans/general.hpp [code] | Plans for Maxima-components related to conflict-patterns of clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/plans/HittingClauseSets.hpp [code] | Plans related to hitting clause-sets |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/testobjects/Conflicts.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/testobjects/HittingClauseSets.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/testobjects/HittingProofSystem.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/tests/Conflicts.mac [code] | Tests for basic conflict-combinatorics-functionality |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/tests/HittingClauseSets.mac [code] | Tests for basic conflict-combinatorics-functionality |
ComputerAlgebra/Satisfiability/Lisp/ConflictCombinatorics/tests/HittingProofSystem.mac [code] | Tests regarding hitting proof systems |
ComputerAlgebra/Satisfiability/Lisp/ConstraintProblems/Conditions.mac [code] | The basic notions for "conditions" |
ComputerAlgebra/Satisfiability/Lisp/ConstraintProblems/Domains.mac [code] | Functions for handling domains |
ComputerAlgebra/Satisfiability/Lisp/ConstraintProblems/Generators.mac [code] | Generators for constraint problems |
ComputerAlgebra/Satisfiability/Lisp/ConstraintProblems/include.mac [code] | Inclusion file for Maxima constraint-satisfaction related functions |
ComputerAlgebra/Satisfiability/Lisp/ConstraintProblems/plans/Conditions.hpp [code] | Plans regarding the basic notions of "conditions" and "constraints" |
ComputerAlgebra/Satisfiability/Lisp/ConstraintProblems/plans/Domains.hpp [code] | Plans regarding domains in constraint problems |
ComputerAlgebra/Satisfiability/Lisp/ConstraintProblems/plans/general.hpp [code] | Plans for Maxima-components regarding constraint satisfaction problems |
ComputerAlgebra/Satisfiability/Lisp/ConstraintProblems/plans/Generators.hpp [code] | Plans regarding generators for constraint problems |
ComputerAlgebra/Satisfiability/Lisp/ConstraintProblems/testobjects/Domains.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/ConstraintProblems/testobjects/Generators.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/ConstraintProblems/tests/Domains.mac [code] | Tests related to handling domains |
ComputerAlgebra/Satisfiability/Lisp/ConstraintProblems/tests/Generators.mac [code] | Tests related to generators for constraint problems |
ComputerAlgebra/Satisfiability/Lisp/Counting/Backtracking.mac [code] | Functions related to counting of satisfying assignments via inclusion/exclusion techniques |
ComputerAlgebra/Satisfiability/Lisp/Counting/Degrees.mac [code] | Functions related to thresholds from SAT to UNSAT related to clause- or variable degrees |
ComputerAlgebra/Satisfiability/Lisp/Counting/include.mac [code] | Inclusion file for Maxima SAT-counting functions |
ComputerAlgebra/Satisfiability/Lisp/Counting/InclusionExclusion.mac [code] | Functions related to counting of satisfying assignments via inclusion/exclusion techniques |
ComputerAlgebra/Satisfiability/Lisp/Counting/RandomClauseSets.mac [code] | Functions related to thresholds from SAT to UNSAT related to clause- or variable degrees |
ComputerAlgebra/Satisfiability/Lisp/Counting/plans/general.hpp [code] | General plans for counting satisfying assignments |
ComputerAlgebra/Satisfiability/Lisp/Counting/testobjects/Backtracking.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Counting/testobjects/Degrees.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Counting/testobjects/InclusionExclusion.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Counting/testobjects/RandomClauseSets.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Counting/tests/Degrees.mac [code] | Tests for SAT-tests related to degrees |
ComputerAlgebra/Satisfiability/Lisp/Counting/tests/InclusionExclusion.mac [code] | Tests for counting via inclusion/exclusion |
ComputerAlgebra/Satisfiability/Lisp/Counting/tests/RandomClauseSets.mac [code] | Tests for SAT-tests related to degrees |
ComputerAlgebra/Satisfiability/Lisp/demos/FundamentsBranchingHeuristics.dem [code] | Accompanying OK's SAT-handbook article [Fundaments of Branching Heuristics; Oliver Kullmann 2009] |
ComputerAlgebra/Satisfiability/Lisp/docus/general.hpp [code] | User documentation for SAT in Lisp/Maxima |
ComputerAlgebra/Satisfiability/Lisp/docus/Tutorial.hpp [code] | Tutorial on SAT in Maxima/Lisp by MH |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/Basics.mac [code] | Basic tools for handling boolean and finite functions |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/include.mac [code] | Inclusion file for Maxima finite function related functions |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/Permutations.mac [code] | Permutations as boolean functions |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/RandomBooleanFunctions.mac [code] | Generating random boolean functions in various forms |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/TseitinTranslation.mac [code] | The Tseitin translation for translating DNF to CNF |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/plans/Arithmetic.hpp [code] | Plans regarding the arithmetical boolean functions |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/plans/BasicFunctions.hpp [code] | Plans regarding the 16 binary boolean functions |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/plans/Basics.hpp [code] | Plans regarding the basics of boolean functions |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/plans/BDDs.hpp [code] | Plans regarding BDDs and variations |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/plans/BranchingPrograms.hpp [code] | Plans regarding branching programs (for finite functions) |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/plans/Complexity.hpp [code] | Plans regarding complexity measurement of boolean functions (and generalisations) |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/plans/general.hpp [code] | Plans regarding boolean functions and generalisations |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/plans/IsomorphismTypes.hpp [code] | Plans regarding isomorphism types of boolean functions (and generalisations) |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/plans/StraightLinePrograms.hpp [code] | Plans regarding straight-line programs ("circuits") |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/plans/Thresholds.hpp [code] | Plans regarding boolean threshold functions |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/plans/TseitinTranslation.hpp [code] | Plans regarding the Tseitin translation from DNF to CNF |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/testobjects/Basics.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/testobjects/Permutations.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/testobjects/RandomBooleanFunctions.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/testobjects/TseitinTranslation.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/tests/Basics.mac [code] | Tests regarding basics for boolean function |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/tests/Permutations.mac [code] | Tests for the analysis functions of permutations as boolean functions |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/tests/RandomBooleanFunctions.mac [code] | Tests regarding random boolean functions |
ComputerAlgebra/Satisfiability/Lisp/FiniteFunctions/tests/TseitinTranslation.mac [code] | Tests regarding the Tseitin translation |
ComputerAlgebra/Satisfiability/Lisp/Generators/Codes.mac [code] | Generators for finding codes via SAT |
ComputerAlgebra/Satisfiability/Lisp/Generators/GeneralisedTicTacToe.mac [code] | Generators for clause-sets related to generalisations of Tic-Tac-Toe |
ComputerAlgebra/Satisfiability/Lisp/Generators/Generators.mac [code] | Basic generators for clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Generators/include.mac [code] | Inclusion file for Maxima clause-set functions |
ComputerAlgebra/Satisfiability/Lisp/Generators/LatinSquares.mac [code] | Generation of Latin square completion problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/LinearEquations.mac [code] | Generators for clause-sets related to linear equations |
ComputerAlgebra/Satisfiability/Lisp/Generators/NonBooleanTranslations.mac [code] | Translations from non-boolean clause-sets to boolean clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Generators/Pigeonhole.mac [code] | Generators for the pigeonhole formulas |
ComputerAlgebra/Satisfiability/Lisp/Generators/PlantedSolutions.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/RandomClauseSets.mac [code] | Functions for basic operations with clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Generators/Sudoku.mac [code] | Generations of Sudoku-problems (also generalised, and also as generalised SAT-problems) |
ComputerAlgebra/Satisfiability/Lisp/Generators/docus/general.hpp [code] | User documentation regarding SAT-instance generators in Lisp/Maxima |
ComputerAlgebra/Satisfiability/Lisp/Generators/docus/Sudoku.hpp [code] | How to use the Sudoku generator functions |
ComputerAlgebra/Satisfiability/Lisp/Generators/plans/general.hpp [code] | Plans for Maxima-generators for clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Generators/plans/LatinSquares.hpp [code] | Plans for Maxima-generators (of SAT-problems) related to latin squares problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/plans/milestones.hpp [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/plans/NonBooleanTranslations.hpp [code] | Plans for translations from non-boolean clause-sets to boolean clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Generators/plans/Pigeonhole.hpp [code] | Plans for Maxima-generators of pigeonhole formulas |
ComputerAlgebra/Satisfiability/Lisp/Generators/plans/PlantedSolutions.hpp [code] | Plans for Maxima-generators for satisfiable instances with given solutions |
ComputerAlgebra/Satisfiability/Lisp/Generators/plans/RandomClauseSets.hpp [code] | Plans for generators for (various types of) random clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Generators/plans/Sudoku.hpp [code] | Plans for Maxima-generators related to Sudoku-like problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/plans/Translations.hpp [code] | Plans for basic clause-set translations |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/GasarchProblems.mac [code] | Generators for clause-sets related to Gasarch problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/GreenTaoProblems.mac [code] | Generators for clause-sets related to Green-Tao problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/HindmanProblems.mac [code] | Generators for clause-sets related to Hindman problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/include.mac [code] | Inclusion file for Maxima Ramsey-theory generator functions |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/RamseyProblems.mac [code] | Generators for Ramsey-problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/SchurProblems.mac [code] | Generators for clause-sets related to Schur problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/VanderWaerdenProblems.mac [code] | Generators for clause-sets related to van der Waerden problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/docus/general.hpp [code] | User documentation for Ramsey theory generators |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/docus/RamseyProblems.hpp [code] | How to use the Ramsey problem generators |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/plans/Gasarch.hpp [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/plans/general.hpp [code] | General plans on generators from Ramsey theory |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/plans/GreenTaoProblems.hpp [code] | Plans for Maxima-generators related to Green-Tao problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/plans/HindmanProblems.hpp [code] | Plans for Maxima-generators related to Hindman problems (and generalisations) |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/plans/milestones.hpp [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/plans/RamseyProblems.hpp [code] | Plans for Maxima-generators for Ramsey-problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/plans/VanderWaerdenProblems.hpp [code] | Plans for Maxima-generators related to van der Waerden problems (and generalisations) |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/testobjects/GreenTaoProblems.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/testobjects/HindmanProblems.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/testobjects/RamseyProblems.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/testobjects/SchurProblems.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/testobjects/VanderWaerdenProblems.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/tests/GreenTaoProblems.mac [code] | Tests for clause-sets related to Green-Tao problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/tests/HindmanProblems.mac [code] | Tests for clause-set-generators |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/tests/RamseyProblems.mac [code] | Tests for Ramsey-problem-generators |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/tests/SchurProblems.mac [code] | Tests for clause-sets related to Schur problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/RamseyTheory/tests/VanderWaerdenProblems.mac [code] | Tests for clause-sets related to van der Waerden problems |
ComputerAlgebra/Satisfiability/Lisp/Generators/testobjects/Generators.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/testobjects/LatinSquares.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/testobjects/LinearEquations.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/testobjects/NonBooleanTranslations.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/testobjects/Pigeonhole.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/testobjects/PlantedSolutions.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/testobjects/RandomClauseSets.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/testobjects/Sudoku.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Generators/tests/Generators.mac [code] | Tests for clause-set-generators |
ComputerAlgebra/Satisfiability/Lisp/Generators/tests/LatinSquares.mac [code] | Tests regarding latin squares |
ComputerAlgebra/Satisfiability/Lisp/Generators/tests/LinearEquations.mac [code] | Tests for clause-set-generators |
ComputerAlgebra/Satisfiability/Lisp/Generators/tests/NonBooleanTranslations.mac [code] | Tests for non-boolean translations |
ComputerAlgebra/Satisfiability/Lisp/Generators/tests/Pigeonhole.mac [code] | Tests for pigeonhole-generators |
ComputerAlgebra/Satisfiability/Lisp/Generators/tests/PlantedSolutions.mac [code] | Tests for generators for instances with planted solutions |
ComputerAlgebra/Satisfiability/Lisp/Generators/tests/RandomClauseSets.mac [code] | Tests for clause-set-generators |
ComputerAlgebra/Satisfiability/Lisp/Generators/tests/Sudoku.mac [code] | Tests for Sudoku generators |
ComputerAlgebra/Satisfiability/Lisp/LinearConditions/plans/general.hpp [code] | Plans regarding pseudo-boolean constraints |
ComputerAlgebra/Satisfiability/Lisp/LocalSearch/plans/general.hpp [code] | Plans for local search SAT algorithms at the Maxima/Lisp level in general |
ComputerAlgebra/Satisfiability/Lisp/LocalSearch/plans/HypergraphColouring.hpp [code] | Plans for local search algorithms specifically for hypergraph colouring |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/Basics.mac [code] | Operations regarding minimally unsatisfiable clause-sets |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/Cores.mac [code] | Functions for computing minimally unsatisfiable and irredundant cores |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/Deficiency2.mac [code] | Generators and analysis w.r.t. minimally unsatisfiable clause-sets of deficiency 2 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/Deficiency3.mac [code] | Generators and analysis w.r.t. minimally unsatisfiable clause-sets of deficiency 3 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/Deficiency4.mac [code] | Generators and analysis w.r.t. minimally unsatisfiable clause-sets of deficiency 4 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/DeficiencyOne.mac [code] | Generators and analysis w.r.t. minimally unsatisfiable clause-sets of deficiency 1 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/include.mac [code] | Inclusion file for Maxima functions related to MUSAT |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/InverseSingularDP.mac [code] | Transforming clause-sets by applying inverse singular DP-reduction |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/MaxVarDegrees.mac [code] | Operations regarding the maximal variable degree of (typicall uniform) minimally unsatisfiable clause-sets |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/MinVarDegrees.mac [code] | Functions regarding the minimal variable-degree of minimally unsatisfiable clause-sets |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/SplittingAnalysis.mac [code] | Analysing the splitting (via partial assignments) of minimally unsatisfiable clause-sets |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/Transformations.mac [code] | Transformations related to minimal unsatisfiability |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def.mac [code] | Classification of unsatisfiable hitting clause-sets in dependency on the deficiency, only considering clause-sets which are reduced w.r.t. singular DP-reduction |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def12.mac [code] | Data for deficiency 12 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def13.mac [code] | Data for deficiency 13 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def14.mac [code] | Data for deficiency 14 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def15.mac [code] | Data for deficiency 15 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def16.mac [code] | Data for deficiency 16 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def17.mac [code] | Data for deficiency 17 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def18.mac [code] | Data for deficiency 18 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def19.mac [code] | Data for deficiency 19 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def20.mac [code] | Data for deficiency 20 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def21.mac [code] | Data for deficiency 21 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def22.mac [code] | Data for deficiency 22 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def23.mac [code] | Data for deficiency 23 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def24.mac [code] | Data for deficiency 24 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def25.mac [code] | Data for deficiency 25 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def4.mac [code] | Data for deficiency 4 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def43.mac [code] | Data for deficiency 43 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def5.mac [code] | Data for deficiency 5 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def6.mac [code] | Data for deficiency 6 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def7.mac [code] | Data for deficiency 7 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def8.mac [code] | Data for deficiency 8 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/data/uhit_def9.mac [code] | Data for deficiency 9 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/plans/Basics.hpp [code] | Plans for basic Maxima-components regarding minimally unsatisfiable clause-sets |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/plans/Cores.hpp [code] | Plans related to irredundant cores |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/plans/Deficiency2.hpp [code] | Plans regarding minimally unsatisfiable clause-sets of deficiency 2 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/plans/DeficiencyOne.hpp [code] | Plans regarding minimally unsatisfiable clause-sets of deficiency 1 |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/plans/general.hpp [code] | Plans for Maxima-components regarding minimally unsatisfiable clause-sets |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/plans/InverseSingularDP.hpp [code] | Plans on transforming clause-sets by applying inverse singular DP-reduction |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/plans/MaxVarDegrees.hpp [code] | Plans related to the determination of the maximal variable degrees of (typically uniform) minimally unsatisfiable clause-sets |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/plans/MinVarDegrees.hpp [code] | Plans regarding the minimal variable-degree of minimally unsatisfiable clause-sets |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/plans/Transformations.hpp [code] | Plans regarding transformations related to minimally unsatisfiable clause-sets |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/plans/uhit_def.hpp [code] | Plans regarding the catalogue of unsatisfiable non-singular hitting clause-sets |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/testobjects/Basics.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/testobjects/Cores.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/testobjects/Deficiency2.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/testobjects/Deficiency3.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/testobjects/Deficiency4.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/testobjects/DeficiencyOne.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/testobjects/InverseSingularDP.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/testobjects/MinVarDegrees.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/testobjects/SplittingAnalysis.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/testobjects/Transformations.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/testobjects/uhit_def.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/tests/Basics.mac [code] | Tests for basic functions regarding minimal unsatisfiability and irredundancy |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/tests/Cores.mac [code] | Tests for functions about finding irredundant cores |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/tests/Deficiency2.mac [code] | Tests for functions related to MUSAT(2) |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/tests/Deficiency3.mac [code] | Tests for functions related to MUSAT(1) |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/tests/Deficiency4.mac [code] | Tests for functions related to MUSAT(1) |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/tests/DeficiencyOne.mac [code] | Tests for functions related to MUSAT(1) |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/tests/InverseSingularDP.mac [code] | Tests for basic functions regarding minimal unsatisfiability and irredundancy |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/tests/MinVarDegrees.mac [code] | Tests for functions regarding min-var-degrees of minimal unsatisfiable clause-sets |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/tests/SplittingAnalysis.mac [code] | Tests for functions about finding irredundant cores |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/tests/Transformations.mac [code] | Tests for functions about transformations related to minimal unsatisfiability |
ComputerAlgebra/Satisfiability/Lisp/MinimalUnsatisfiability/tests/uhit_def.mac [code] | Tests for the catalogue on reduced unsatisfiable hitting clause-sets of given deficiency |
ComputerAlgebra/Satisfiability/Lisp/plans/Clauses.hpp [code] | Plans for clause-constructions |
ComputerAlgebra/Satisfiability/Lisp/plans/general.hpp [code] | Plans for SAT at Maxima/Lisp level in general |
ComputerAlgebra/Satisfiability/Lisp/plans/IteratedConditionSystems.hpp [code] | Plans for satisfaction problems given by transition functions |
ComputerAlgebra/Satisfiability/Lisp/plans/Literals.hpp [code] | Plans for literals ("concrete") |
ComputerAlgebra/Satisfiability/Lisp/plans/milestones.hpp [code] | |
ComputerAlgebra/Satisfiability/Lisp/plans/MinimalSatisfyingAssignments.hpp [code] | Plans for computing the set of minimal satisfying assignments |
ComputerAlgebra/Satisfiability/Lisp/plans/PartialAssignments.hpp [code] | Plans regarding partial assignments |
ComputerAlgebra/Satisfiability/Lisp/plans/SatisfactionProblems.hpp [code] | Plans for satisfaction problems (in general) |
ComputerAlgebra/Satisfiability/Lisp/Preprocessing/plans/Examples.hpp [code] | Applying preprocessing to specific instance classes |
ComputerAlgebra/Satisfiability/Lisp/Preprocessing/plans/general.hpp [code] | Plans for preprocessing of SAT problems in general |
ComputerAlgebra/Satisfiability/Lisp/Primality/Basics.mac [code] | The basic functions regarding prime clauses |
ComputerAlgebra/Satisfiability/Lisp/Primality/include.mac [code] | Inclusion file for Maxima functions related to the notion of prime clauses |
ComputerAlgebra/Satisfiability/Lisp/Primality/PrimeImplicatesImplicants.mac [code] | Functions regarding computation of prime implicates/implicants of boolean functions and clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Primality/plans/general.hpp [code] | General plans for handling prime clauses and dual prime clauses |
ComputerAlgebra/Satisfiability/Lisp/Primality/plans/PrimeImplicatesImplicants.hpp [code] | Plans for Maxima-components regarding computation of prime implicates/implicants of boolean functions and clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Primality/testobjects/Basics.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Primality/testobjects/PrimeImplicatesImplicants.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Primality/tests/Basics.mac [code] | Tests for basic components related to prime clauses |
ComputerAlgebra/Satisfiability/Lisp/Primality/tests/PrimeImplicatesImplicants.mac [code] | Tests for splitting trees |
ComputerAlgebra/Satisfiability/Lisp/Propagation/plans/general.hpp [code] | Plans for SAT algorithms related propagation algorithms like belief and survey propagation |
ComputerAlgebra/Satisfiability/Lisp/PropositionalLogic/Backtracking.mac [code] | Functions for SAT decision for propositional formulas |
ComputerAlgebra/Satisfiability/Lisp/PropositionalLogic/Formulas.mac [code] | Functions for basic representations of and operations with formulas |
ComputerAlgebra/Satisfiability/Lisp/PropositionalLogic/include.mac [code] | Inclusion file for Maxima functions regarding propositional logic |
ComputerAlgebra/Satisfiability/Lisp/PropositionalLogic/plans/Formulas.hpp [code] | Plans on representations of propositional logic |
ComputerAlgebra/Satisfiability/Lisp/PropositionalLogic/plans/general.hpp [code] | Plans for Maxima-components regarding propositional logic |
ComputerAlgebra/Satisfiability/Lisp/PropositionalLogic/plans/milestones.hpp [code] | |
ComputerAlgebra/Satisfiability/Lisp/PropositionalLogic/plans/TseitinTranslation.hpp [code] | Plans for Maxima-components translating from propositional logic to CNF via the Tseitin translation (and variations) |
ComputerAlgebra/Satisfiability/Lisp/PropositionalLogic/testobjects/Backtracking.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/PropositionalLogic/testobjects/Formulas.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/PropositionalLogic/tests/Backtracking.mac [code] | Tests for backtracking solvers for propositional formulas |
ComputerAlgebra/Satisfiability/Lisp/PropositionalLogic/tests/Formulas.mac [code] | Tests for basic functionality regarding propositional formulas |
ComputerAlgebra/Satisfiability/Lisp/PseudoBoolean/CardinalityConstraints.mac [code] | Translating cardinality constraints into CNF |
ComputerAlgebra/Satisfiability/Lisp/PseudoBoolean/include.mac [code] | Inclusion file for Maxima functions regarding pseudo-boolean constraints |
ComputerAlgebra/Satisfiability/Lisp/PseudoBoolean/docus/CardinalityConstraints.hpp [code] | How to use the translations of cardinality constraint generators into CNF |
ComputerAlgebra/Satisfiability/Lisp/PseudoBoolean/docus/general.hpp [code] | User documentation regarding pseudo-boolean constraints |
ComputerAlgebra/Satisfiability/Lisp/PseudoBoolean/plans/CardinalityConstraints.hpp [code] | Plans for translations of cardinality constraints into CNF |
ComputerAlgebra/Satisfiability/Lisp/PseudoBoolean/plans/general.hpp [code] | Plans regarding pseudo-boolean constraints |
ComputerAlgebra/Satisfiability/Lisp/PseudoBoolean/testobjects/CardinalityConstraints.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/PseudoBoolean/tests/CardinalityConstraints.mac [code] | Tests for translations of cardinality constraints into CNF |
ComputerAlgebra/Satisfiability/Lisp/Quantification/plans/general.hpp [code] | Plans on quantified satisfiability problems |
ComputerAlgebra/Satisfiability/Lisp/Reductions/Basics.mac [code] | Basic reductions |
ComputerAlgebra/Satisfiability/Lisp/Reductions/DP-Reductions.mac [code] | Special cases of applications of the DP-operator which yield reductions |
ComputerAlgebra/Satisfiability/Lisp/Reductions/GeneralisedUCP.mac [code] | Functions for generalised unit-clause-propagation on clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Reductions/Hardness.mac [code] | Functions related to the hardness of clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Reductions/include.mac [code] | Inclusion file for Maxima functions on SAT-reductions |
ComputerAlgebra/Satisfiability/Lisp/Reductions/RBases.mac [code] | Removing redundancies from clause-sets by reductions |
ComputerAlgebra/Satisfiability/Lisp/Reductions/ResolutionReductions.mac [code] | Special cases of applications of resolutions which yield reductions |
ComputerAlgebra/Satisfiability/Lisp/Reductions/UnitClausePropagation.mac [code] | Functions for unit-clause-propagation on clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Reductions/plans/DP-Reductions.hpp [code] | Plans on special cases of DP-resolution which lead to "reductions" |
ComputerAlgebra/Satisfiability/Lisp/Reductions/plans/FailedLiteralReduction.hpp [code] | Plans for Maxima-components regarding r_2-reductions |
ComputerAlgebra/Satisfiability/Lisp/Reductions/plans/general.hpp [code] | Plans for Maxima-components regarding SAT-reductions (in general) |
ComputerAlgebra/Satisfiability/Lisp/Reductions/plans/GeneralisedUCP.hpp [code] | Plans for Maxima-components regarding r_k-reductions |
ComputerAlgebra/Satisfiability/Lisp/Reductions/plans/RBases.hpp [code] | Plans for removing redundancies from the set of prime implicates |
ComputerAlgebra/Satisfiability/Lisp/Reductions/plans/UnitClausePropagation.hpp [code] | Plans for Maxima-components regarding UCP |
ComputerAlgebra/Satisfiability/Lisp/Reductions/testobjects/Basics.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Reductions/testobjects/DP-Reductions.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Reductions/testobjects/GeneralisedUCP.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Reductions/testobjects/Hardness.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Reductions/testobjects/RBases.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Reductions/testobjects/ResolutionReductions.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Reductions/testobjects/UnitClausePropagation.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Reductions/tests/Basics.mac [code] | Tests regarding the most basic reductions |
ComputerAlgebra/Satisfiability/Lisp/Reductions/tests/DP-Reductions.mac [code] | Tests for SAT-reductions |
ComputerAlgebra/Satisfiability/Lisp/Reductions/tests/GeneralisedUCP.mac [code] | Tests for SAT-reductions |
ComputerAlgebra/Satisfiability/Lisp/Reductions/tests/Hardness.mac [code] | Tests for components related to hardness |
ComputerAlgebra/Satisfiability/Lisp/Reductions/tests/RBases.mac [code] | Tests for components related to r-bases |
ComputerAlgebra/Satisfiability/Lisp/Reductions/tests/ResolutionReductions.mac [code] | Tests for SAT-reductions |
ComputerAlgebra/Satisfiability/Lisp/Reductions/tests/UnitClausePropagation.mac [code] | Tests for reductions by unit-clause-propagations |
ComputerAlgebra/Satisfiability/Lisp/Resolution/Basics.mac [code] | Functions for resolution operations on clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Resolution/Graphs.mac [code] | Functions for resolution operations on clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Resolution/include.mac [code] | Inclusion file for Maxima resolution-related functions |
ComputerAlgebra/Satisfiability/Lisp/Resolution/Proofs.mac [code] | Components for handling resolution proofs |
ComputerAlgebra/Satisfiability/Lisp/Resolution/Search.mac [code] | Searching for shortest resolution proofs |
ComputerAlgebra/Satisfiability/Lisp/Resolution/plans/Basics.hpp [code] | Plans for Maxima-components regarding the basic functions for the resolution calculus |
ComputerAlgebra/Satisfiability/Lisp/Resolution/plans/general.hpp [code] | Plans for Maxima-components regarding the resolution calculus |
ComputerAlgebra/Satisfiability/Lisp/Resolution/plans/milestones.hpp [code] | |
ComputerAlgebra/Satisfiability/Lisp/Resolution/plans/Proofs.hpp [code] | Plans regarding handling of resolution proofs |
ComputerAlgebra/Satisfiability/Lisp/Resolution/plans/Search.hpp [code] | Plans regarding searching for short resolution proofs |
ComputerAlgebra/Satisfiability/Lisp/Resolution/testobjects/Basics.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Resolution/testobjects/Graphs.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Resolution/testobjects/Proofs.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Resolution/testobjects/Search.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Resolution/tests/Basics.mac [code] | Tests for basic resolution functionality |
ComputerAlgebra/Satisfiability/Lisp/Resolution/tests/Graphs.mac [code] | Tests regarding resolution graphs |
ComputerAlgebra/Satisfiability/Lisp/Resolution/tests/Proofs.mac [code] | Tests related to resolution proofs |
ComputerAlgebra/Satisfiability/Lisp/Resolution/tests/Search.mac [code] | Tests related to resolution proofs |
ComputerAlgebra/Satisfiability/Lisp/Symmetries/include.mac [code] | Inclusion file for functions related to symmetries for clause-sets (and more general SAT-forms) |
ComputerAlgebra/Satisfiability/Lisp/Symmetries/Symmetries.mac [code] | Functionality related to symmetries of clause-sets |
ComputerAlgebra/Satisfiability/Lisp/Symmetries/plans/general.hpp [code] | Plans for Maxima-components regarding symmetries in satisfiability problems |
ComputerAlgebra/Satisfiability/Lisp/Symmetries/testobjects/Symmetries.mac [code] | |
ComputerAlgebra/Satisfiability/Lisp/Symmetries/tests/Symmetries.mac [code] | Tests for symmetry operations (on clause-sets) |
ComputerAlgebra/Satisfiability/plans/general.hpp [code] | Plans for SAT via computer-algebra-systems in general |
ComputerAlgebra/Satisfiability/plans/milestones.hpp [code] | |
ComputerAlgebra/TermSystems/Lisp/Conversions.mac [code] | Conversions to help with the Maxima/Lisp term system |
ComputerAlgebra/TermSystems/Lisp/include.mac [code] | Inclusion file for Maxima functions related to terms |
ComputerAlgebra/TermSystems/Lisp/testobjects/Conversions.mac [code] | |
ComputerAlgebra/TermSystems/Lisp/tests/Conversions.mac [code] | Tests for list-processing functions |
ComputerAlgebra/TestSystem/Lisp/Asserts.mac [code] | Maxima functions for asserts |
ComputerAlgebra/TestSystem/Lisp/include.mac [code] | Central inclusion file for Maxima test system functions |
ComputerAlgebra/TestSystem/Lisp/plans/general.hpp [code] | General plans for the Maxima test system |
ComputerAlgebra/TestSystem/Lisp/plans/Guidelines.hpp [code] | Plans on providing guidelines on the test system |
ComputerAlgebra/Trees/Lisp/Basics.mac [code] | Functions for handling trees |
ComputerAlgebra/Trees/Lisp/include.mac [code] | Inclusion file for Maxima trees-related functions |
ComputerAlgebra/Trees/Lisp/ReingoldTilford.mac [code] | Functions related to the Reingold-Tilford algorithm |
ComputerAlgebra/Trees/Lisp/Visualisation.mac [code] | Functions for tree drawing using Gnuplot |
ComputerAlgebra/Trees/Lisp/docus/general.hpp [code] | User documentation for trees in Lisp/Maxima |
ComputerAlgebra/Trees/Lisp/docus/Tutorial.hpp [code] | Tutorial on trees in Maxima/Lisp |
ComputerAlgebra/Trees/Lisp/plans/Basics.hpp [code] | Plans regarding basic tree-functionality |
ComputerAlgebra/Trees/Lisp/plans/general.hpp [code] | General plans regarding trees in Maxima/Lisp |
ComputerAlgebra/Trees/Lisp/plans/ReingoldTilford.hpp [code] | Plans regarding Reingold-Tilford algorithm in Maxima/Lisp |
ComputerAlgebra/Trees/Lisp/plans/Visualisation.hpp [code] | Plans regarding visualisation of trees |
ComputerAlgebra/Trees/Lisp/testobjects/Basics.mac [code] | |
ComputerAlgebra/Trees/Lisp/testobjects/ReingoldTilford.mac [code] | |
ComputerAlgebra/Trees/Lisp/testobjects/Visualisation.mac [code] | |
ComputerAlgebra/Trees/Lisp/tests/Basics.mac [code] | Tests related to rooted trees |
ComputerAlgebra/Trees/Lisp/tests/ReingoldTilford.mac [code] | Tests related to Reingold-Tilford algorithm |
ComputerAlgebra/Trees/Lisp/tests/Visualisation.mac [code] | Tests related to tree drawing functions |
Concepts/AtomicConditions.hpp [code] | Concepts for atomic conditions (predicates) |
Concepts/Basics.hpp [code] | Basic concepts, extending the basic concepts from the standard |
Concepts/Basics_Testobjects.hpp [code] | |
Concepts/Basics_Tests.hpp [code] | Test classes to help with determining, whether a class models the basic concepts |
Concepts/ConceptsBase.hpp [code] | Contains the base class for concept tags and related constructs; used internally |
Concepts/ConceptsMetafunctions.hpp [code] | Metafunctions concerning the relations between concepts, concept tags and models; used mainly internally |
Concepts/ConceptsMetafunctions_Testobjects.hpp [code] | |
Concepts/ConceptsMetafunctions_Tests.hpp [code] | |
Concepts/InputOutput.hpp [code] | Concepts concerning general input and output |
Concepts/InputOutput_Testobjects.hpp [code] | |
Concepts/InputOutput_Tests.hpp [code] | Generic tests for models of the concepts concerning general input and output |
Concepts/Iterators.hpp [code] | Concepts for iterators extending the concepts from the standard |
Concepts/JoinedConceptTags.hpp [code] | Concept tags for (fundamental) types in case the type models several concepts |
Concepts/LibraryBasics.hpp [code] | The very basic concepts for the library. Every unit where concepts are defined and/or checked should include this file. Provides macros OKLIB_MODELS_CONCEPT_REQUIRES and OKLIB_MODELS_CONCEPT_TAG for checking whether a class models a concept and has the required concept tag. Every "own concept" of the library must be a refinement of BasicRequirements |
Concepts/LibraryBasics_Testobjects.hpp [code] | |
Concepts/LibraryBasics_Tests.hpp [code] | Tools for testing concept definitions (and related constructions) |
Concepts/Literals.hpp [code] | Concepts for literals |
Concepts/RefactoringIncludeHandling.hpp [code] | Concepts for refactoring tools regarding replacement of include directives |
Concepts/RefactoringIncludeHandling_Testobjects.hpp [code] | |
Concepts/RefactoringIncludeHandling_Tests.hpp [code] | Generic tests for refactoring tools regarding replacement of include directives |
Concepts/ResultElements.hpp [code] | Concepts for result elements, representing results of SAT solvers (especially for competitions) |
Concepts/ResultElements_Testobjects.hpp [code] | |
Concepts/ResultElements_Tests.hpp [code] | Testing alleged models of (refinements of) concept Concepts::ResultElement |
Concepts/std_Basics.hpp [code] | Basic concepts from ISO/IEC 14882: 2003 (the "Standard") plus const-correctness |
Concepts/std_Basics_Testobjects.hpp [code] | |
Concepts/std_Basics_Tests.hpp [code] | Test classes for the basic concepts from the standard |
Concepts/std_Container.hpp [code] | Container concepts from ISO/IEC 14882: 2003 (plus const-correctness) |
Concepts/std_Container_Testobjects.hpp [code] | |
Concepts/std_Container_Tests.hpp [code] | Generic tests related to container concepts from the standard |
Concepts/std_Iterators.hpp [code] | Iterator concepts from ISO/IEC 14882: 2003 (plus const-correctness). As for all concepts in "std_ ...", the concepts here are not refinements of OKlib::Concepts::BasicRequirements |
Concepts/std_Iterators_Testobjects.hpp [code] | |
Concepts/std_Iterators_Tests.hpp [code] | Tests for validating whether a class models one of the five iterator concepts from the standard |
Concepts/TestConcepts.cpp [code] | |
Concepts/Variables.hpp [code] | Concepts for variables |
Concepts/Variables_Testobjects.hpp [code] | Checking whether concept and archetype definitions are consistent |
Concepts/Variables_Tests.hpp [code] | Generic tests for models of variable concepts |
Concepts/plans/ActiveClauseSets.hpp [code] | Plans for the concept of an active clause-set |
Concepts/plans/AtomicConditions.hpp [code] | Plans for concepts for atomic conditions |
Concepts/plans/Basics.hpp [code] | Plans regarding basic concepts |
Concepts/plans/BipartiteGraphs.hpp [code] | Plans for concepts for bipartite graphs |
Concepts/plans/ClauseSets.hpp [code] | Plans for concepts for clause-sets, clause-sets with history, virtual clause-sets and active clause-sets |
Concepts/plans/ConceptsMetafunctions.hpp [code] | Plans for the submodule on concept-related metafunctions |
Concepts/plans/general.hpp [code] | General plans for the concepts module |
Concepts/plans/InputOutput.hpp [code] | Plans for concepts concerning general input/output |
Concepts/plans/Iterators.hpp [code] | Plans on concepts for iterators |
Concepts/plans/LibraryBasics.hpp [code] | Plans for most basic concepts |
Concepts/plans/Literals.hpp [code] | Plans for concepts for literals |
Concepts/plans/milestones.hpp [code] | |
Concepts/plans/RefactoringIncludeHandling.hpp [code] | Plans regarding the concepts on refactoring tools |
Concepts/plans/Variables.hpp [code] | Plans for concepts for Variables |
Concepts/testobjects/AtomicConditions.cpp [code] | Checking whether concept and archetype definitions are consistent |
Concepts/testobjects/Literals.cpp [code] | Checking whether concept and archetype definitions are consistent |
Concepts/tests/AtomicConditions.hpp [code] | Generic tests for models of concept AtomicCondition |
Concepts/tests/Literals.hpp [code] | Generic tests for models of concept Literals |
Concepts/traits/concept_tag.hpp [code] | Traits-metafunctions to extract the concept tag |
DataStructures/docus/general.hpp [code] | |
DataStructures/Search/AssociativeContainers.hpp [code] | Associative containers |
DataStructures/Search/AssociativeContainers_Testobjects.hpp [code] | |
DataStructures/Search/AssociativeContainers_Tests.hpp [code] | Tests for search data structures |
DataStructures/Search/TestSearchDataStructures.cpp [code] | |
DataStructures/Search/plans/general.hpp [code] | Plans for the supermodule on searching |
DataStructures/Search/plans/milestones.hpp [code] | |
DataStructures/Trees/plans/general.hpp [code] | Plans for the module with tree datastructures |
demos/general.hpp [code] | Entry page into the demos-system |
docus/general.hpp [code] | The central docus-file for the library |
Experimentation/Benchmarks/docus/general.hpp [code] | Central docus-file regarding benchmark packages |
Experimentation/Benchmarks/docus/SAT2011.hpp [code] | Benchmarks for the SAT 2011 competitions |
Experimentation/Benchmarks/plans/general.hpp [code] | Plans for producing benchmarks |
Experimentation/Competition/Analyse.cpp [code] | Reading in a data file, computing the lexicographical order of solvers. Superseded by ComputeLexicographicalEvaluation (which handles directly the original data file) |
Experimentation/Competition/AnalysisTools.hpp [code] | Class ElementaryAnalysis<Database> (supplying Database with some "indices") and related constructs |
Experimentation/Competition/AnalysisTools_Testobjects.hpp [code] | |
Experimentation/Competition/AnalysisTools_Tests.hpp [code] | |
Experimentation/Competition/ComputeAnalysis.cpp [code] | Analyse a file with competition data by printing out for all benchmarks the number of succesful solvers, the result problem purse, the speed factor and the SAT status (as determined by the solver results) |
Experimentation/Competition/ComputeLexicographicalEvaluation.cpp [code] | Outputs the lexicographically sorted evaluation of a random-competition |
Experimentation/Competition/ComputeScores.cpp [code] | Outputs the sorted scores for all solvers from competition data (given as a file). With the optional parameter syntax=... (currently it doesn't matter, but it must be non-empty) the extended syntax is used, and with the optional parameter series=... (currently it doesn't matter, but it must be non-empty) the series purse is computed without performing case distinctions |
Experimentation/Competition/LexicographicalEvaluation.hpp [code] | Evaluation of an "indexed database" by providing comparison tools based on aggregated series evaluations |
Experimentation/Competition/LexicographicalEvaluation_Testobjects.hpp [code] | |
Experimentation/Competition/LexicographicalEvaluation_Tests.hpp [code] | Tests for tools evaluating an "indexed database" by providing comparison tools |
Experimentation/Competition/LexicographicalEvaluationPolicies.hpp [code] | Policies used by LexicographicalEvaluation.hpp |
Experimentation/Competition/ParsingResultSequences.hpp [code] | |
Experimentation/Competition/ParsingResultSequences_Testobjects.hpp [code] | |
Experimentation/Competition/ParsingResultSequences_Tests.hpp [code] | |
Experimentation/Competition/ParsingSingleResult.hpp [code] | Parser classes for parsing parts of some result ("result elements"), and the parser classe template ParserResult for parsing complete results (respectively "random-results") |
Experimentation/Competition/ParsingSingleResult_Testobjects.hpp [code] | |
Experimentation/Competition/ParsingSingleResult_Tests.hpp [code] | |
Experimentation/Competition/ResultProcessing.hpp [code] | Classes for building from a raw sequence of results the bipartite attribute-result graph and accessing the set of common results for a set of attribute values |
Experimentation/Competition/ResultProcessing_Testobjects.hpp [code] | |
Experimentation/Competition/ResultProcessing_Tests.hpp [code] | |
Experimentation/Competition/Scoring.hpp [code] | Given an "indexed database", computing the solver scores |
Experimentation/Competition/Scoring_Testobjects.hpp [code] | |
Experimentation/Competition/Scoring_Tests.hpp [code] | Tests for scoring tools |
Experimentation/Competition/SingleResult.hpp [code] | Classes for representing results of one solver on one problem instance |
Experimentation/Competition/SingleResult_Testobjects.hpp [code] | |
Experimentation/Competition/SingleResult_Tests.hpp [code] | |
Experimentation/Competition/TestSATCompetition.cpp [code] | |
Experimentation/Competition/plans/general.hpp [code] | Plans for the module on evaluations of SAT competitions (in general, including "competitions" in articles) |
Experimentation/Competition/plans/milestones.hpp [code] | |
Experimentation/Competition/traits/floating_point_type.hpp [code] | Traits-metafunctions to extract the floating point type |
Experimentation/Competition/traits/natural_number_type.hpp [code] | Traits-metafunctions to extract the natural_number type |
Experimentation/Competition/traits/string_type.hpp [code] | Traits-metafunctions to extract the string type |
Experimentation/Competition/TwoSolverComparison/plans/general.hpp [code] | General plans regarding methods for comparing two solvers |
Experimentation/Competition/TwoSolverComparison/plans/milestones.hpp [code] | |
Experimentation/Competition/TwoSolverComparison/plans/ProbabilityOfSuperiority.hpp [code] | Plans regarding the method for comparing two solvers according to [Mladen Nikolic, 2010] |
Experimentation/Database/CreateStatistic.cpp [code] | Extracting the three .csv-files out of the random-formulas database |
Experimentation/Database/Delete_rows.cpp [code] | |
Experimentation/Database/Special_update.cpp [code] | |
Experimentation/Database/plans/general.hpp [code] | Plans for the module concerning the formulas-database |
Experimentation/Database/plans/milestones.hpp [code] | |
Experimentation/docus/general.hpp [code] | Central docus-file for the part on tools and plans/results regarding experimentation |
Experimentation/ExperimentSystem/ControllingLocalSearch/plans/AlgorithmSelection.hpp [code] | Tools for choosing good local search algorithms from a collection |
Experimentation/ExperimentSystem/ControllingLocalSearch/plans/DataCollection.hpp [code] | Tools for getting data from local search algorithms |
Experimentation/ExperimentSystem/ControllingLocalSearch/plans/Evaluation.hpp [code] | Tools for evaluating local search algorithms |
Experimentation/ExperimentSystem/ControllingLocalSearch/plans/general.hpp [code] | Tools for running and evaluating local search algorithms |
Experimentation/ExperimentSystem/ControllingLocalSearch/plans/milestones.hpp [code] | |
Experimentation/ExperimentSystem/ControllingLocalSearch/plans/ParameterTuning.hpp [code] | Tools for tuning local search algorithms |
Experimentation/ExperimentSystem/ControllingLocalSearch/plans/PointOfUnsatisfiability.hpp [code] | Tools for guessing the first point of unsatisfiability in a series of problems (with one turning point) |
Experimentation/ExperimentSystem/ControllingLocalSearch/plans/Ubcsat-okl.hpp [code] | Plans on the wrapper for Ubcsat |
Experimentation/ExperimentSystem/plans/DistributedSolving.hpp [code] | Plans for distributed SAT solving |
Experimentation/ExperimentSystem/plans/general.hpp [code] | Launching and monitoring experiments on remote machines |
Experimentation/ExperimentSystem/plans/milestones.hpp [code] | |
Experimentation/ExperimentSystem/SolverMonitoring/plans/general.hpp [code] | General plans regarding monitoring solvers |
Experimentation/ExperimentSystem/SolverMonitoring/plans/Glucose.hpp [code] | General plans monitoring glucose and glucose-2.0 |
Experimentation/ExperimentSystem/SolverMonitoring/plans/milestones.hpp [code] | |
Experimentation/ExperimentSystem/SolverMonitoring/plans/Minisat2.hpp [code] | General plans monitoring Minisat2 |
Experimentation/ExperimentSystem/SolverMonitoring/plans/OKsolver.hpp [code] | General plans monitoring OKsolver_2002 |
Experimentation/ExperimentSystem/SolverMonitoring/plans/Picosat.hpp [code] | General plans monitoring Picosat |
Experimentation/Investigations/BooleanFunctions/Permutations.mac [code] | Tools experimentation regarding permutations as boolean functions |
Experimentation/Investigations/BooleanFunctions/MinimumRepresentations/plans/general.hpp [code] | On investigations into minimum representations of boolean functions |
Experimentation/Investigations/BooleanFunctions/plans/BinaryAddition.hpp [code] | Investigations regarding the presentation of binary addition |
Experimentation/Investigations/BooleanFunctions/plans/BooleanFunctions.hpp [code] | On investigations regarding arbitary boolean functions |
Experimentation/Investigations/BooleanFunctions/plans/general.hpp [code] | On investigations regarding boolean functions |
Experimentation/Investigations/BooleanFunctions/plans/QuineMcCluskey.hpp [code] | On investigations around the Quine-McCluskey algorithm |
Experimentation/Investigations/BooleanFunctions/plans/ReductionBasedRepresentations.hpp [code] | On investigations into boolean function representations with different inference properties |
Experimentation/Investigations/BooleanFunctions/plans/UnaryAddition.hpp [code] | Investigations regarding the presentation of unary addition |
Experimentation/Investigations/BooleanFunctions/plans/Hardness/DopedMUOne.hpp [code] | Investigations regarding hardness of doped elements of MU(1) |
Experimentation/Investigations/BooleanFunctions/plans/Hardness/general.hpp [code] | On investigations regarding the hardness of representations of boolean functions |
Experimentation/Investigations/BooleanFunctions/plans/Hardness/LinearEquations.hpp [code] | Investigations regarding hardness of representations of systems of linear equations |
Experimentation/Investigations/BooleanFunctions/plans/Permutations/general.hpp [code] | Investigating boolean functions representing permutations of {0,1}^n |
Experimentation/Investigations/BooleanFunctions/plans/Permutations/Linear.hpp [code] | Investigating boolean functions representing linear permutations of {0,1}^n |
Experimentation/Investigations/BooleanTranslations/plans/general.hpp [code] | On investigations regarding translations of generalised clause-sets into boolean clause-sets |
Experimentation/Investigations/BooleanTranslations/plans/LogarithmicTranslation.hpp [code] | |
Experimentation/Investigations/BooleanTranslations/plans/NestedTranslation.hpp [code] | On investigations regarding the nested translations |
Experimentation/Investigations/CategoriesCls/plans/general.hpp [code] | On investigations regarding categories of clause-sets |
Experimentation/Investigations/Colouring/plans/general.hpp [code] | General plans regarding investigations on colouring problems |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/AESKeyDiscovery.hpp [code] | On investigations on finding AES keys given plaintext and ciphertext pairs |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Benchmarks.hpp [code] | Benchmarks for submission to the 2011 SAT competition |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/CryptographicProperties.hpp [code] | On investigating the cryptographic properties of AES and small scale variations |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/EncryptionDecryption.hpp [code] | On investigating encryption and decryption using AES SAT-translation |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Experimentation.hpp [code] | AES experiments related to the SAT 2012 paper |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/general.hpp [code] | On investigations into the Advanced Encryption Standard |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/milestones.hpp [code] | |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/general.hpp [code] | Investigations into AES key discovery |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/milestones.hpp [code] | |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/004/1_1_4/10_13.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 1 column and 4-bit field elements for 10 rounds AES with MixColumns |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/004/1_1_4/1_13.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 1 column and 4-bit field elements for 1 round AES (1+1/3) |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/004/1_1_4/20_13.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 1 column and 4-bit field elements for 20+1/3 round AES |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/004/1_1_4/general.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 1 column and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/008/1_1_8/10_13.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 1 column and 8-bit field elements for 10 + 1/3 round AES |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/008/1_1_8/20_13.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 1 column and 8-bit field elements for 20 + 1/3 round AES |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/008/1_1_8/general.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 1 column and 8-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/008/1_2_4/20_13.hpp [code] | Investigations into small-scale AES key discovery for 20+1/3 round AES with 1 row, 2 columns and 4-bit field size |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/008/1_2_4/general.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 2 column and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/008/2_1_4/general.hpp [code] | Investigations into small-scale AES key discovery for AES with a 2x1 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/008/2_1_4/Translations.hpp [code] | Listing the translations for the small-scale AES key discovery for AES with a 2x1 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/012/1_3_4/general.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 3 column and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/016/1_2_8/general.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 2 column and 8-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/016/1_4_4/general.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 4 column and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/016/2_1_8/10_13.hpp [code] | Investigations into small scale AES key discovery for 10 + 1/3 round AES with a 2x1 plaintext matrix and 8-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/016/2_1_8/14_13.hpp [code] | Investigations into small scale AES key discovery for 14 + 1/3 round AES with a 2x1 plaintext matrix and 8-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/016/2_1_8/1_13.hpp [code] | Investigations into small-scale AES key discovery for 1 + 1/3 round AES with a 2x1 plaintext matrix and 8-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/016/2_1_8/general.hpp [code] | Investigations into small-scale AES key discovery for AES with a 2x1 plaintext matrix and 8-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/016/2_1_8/Translations.hpp [code] | Listing the translations for the small-scale AES key discovery for AES with a 2x1 plaintext matrix and 8-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/016/2_2_4/1_13.hpp [code] | Investigations into small-scale AES key discovery for 1 + 1/3 round AES with a 2x2 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/016/2_2_4/20_13.hpp [code] | Investigations into small-scale AES key discovery for 20 + 1/3 round AES with a 2x2 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/016/2_2_4/2_13.hpp [code] | Investigations into small-scale AES key discovery for 2 + 1/3 round AES with a 2x2 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/016/2_2_4/4_13.hpp [code] | Investigations into small-scale AES key discovery for 4 + 1/3 round AES with a 2x2 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/016/2_2_4/general.hpp [code] | Investigations into small-scale AES key discovery for AES with a 2x2 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/020/1_5_4/general.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 5 columns and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/024/1_3_8/general.hpp [code] | Investigations into small-scale AES key discovery with 1 row, 3 columns and 8-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/032/2_4_4/1_13.hpp [code] | Investigations into small-scale AES key discovery for 1+1/3 round AES with a 2x4 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/032/2_4_4/3_13.hpp [code] | Investigations into small-scale AES key discovery for 3+1/3 round AES with a 2x4 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/032/2_4_4/5_13.hpp [code] | Investigations into small-scale AES key discovery for 5+1/3 round AES with a 2x4 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/032/2_4_4/general.hpp [code] | Investigations into small-scale AES key discovery for AES with a 2x4 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/032/4_2_4/1_13.hpp [code] | Investigations into small-scale AES key discovery for 1+1/3 round AES with a 4x2 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/032/4_2_4/2_13.hpp [code] | Investigations into small-scale AES key discovery for 2 + 1/3 round AES with a 4x2 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/032/4_2_4/general.hpp [code] | Investigations into small-scale AES key discovery for AES with a 4x2 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/064/1_16_4/4_13.hpp [code] | Investigations into small-scale AES key discovery for 4 + 1/3 round AES with a 1x16 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/064/1_16_4/5_13.hpp [code] | Investigations into small-scale AES key discovery for 5 + 1/3 round AES with a 1x16 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/064/1_16_4/general.hpp [code] | Investigations into small-scale AES key discovery for AES with a 1x16 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/064/4_4_4/1_13.hpp [code] | Investigations into small-scale AES key discovery for 1 round AES with a 4x4 plaintext matrix and 4-bit field elements (1+1/3) |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/064/4_4_4/general.hpp [code] | Investigations into small-scale AES key discovery for AES with a 4x4 plaintext matrix and 4-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/128/1_16_8/2_13.hpp [code] | Investigations into small-scale AES key discovery for 2+1/3 round AES with 1 row and 16 columns |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/128/1_16_8/general.hpp [code] | Investigations into small-scale AES key discovery for AES with a 1x16 plaintext matrix and 8-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/128/4_4_8/0_23_13.hpp [code] | Investigations into AES key discovery for 1 round AES without MixColumns (0+2/3+1/3) |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/128/4_4_8/1_13.hpp [code] | Investigations into AES key discovery for 1 round AES (1+1/3) |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/KeyDiscovery/128/4_4_8/general.hpp [code] | Investigations into AES key discovery for AES with a 4x4 plaintext matrix and 8-bit field elements |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/general.hpp [code] | Investigations into representations for components of the AES related to the SAT 2011 paper |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/Inv_8.hpp [code] | Investigations into the AES field-inversion (8-bit) |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/LinearMap_8.hpp [code] | Investigations into the AES Sbox linear map (8-bit) |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/Methods.hpp [code] | Methods for finding various representations of the AES boxes |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/milestones.hpp [code] | |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/MixColumns.hpp [code] | Studying good representations of the AES (small-scale) MixColumns operations |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/Mul_11_8.hpp [code] | Investigations into AES field multiplication by 11 for the 8-bit field |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/Mul_13_8.hpp [code] | Investigations into AES field multiplication by 13 for the 8-bit field |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/Mul_14_8.hpp [code] | Investigations into AES field multiplication by 14 for the 8-bit field |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/Mul_2_8.hpp [code] | Investigations into AES field multiplication by 02 for the 8-bit field |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/Mul_3_8.hpp [code] | Investigations into AES field multiplication by 03 for the 8-bit field |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/Mul_9_8.hpp [code] | Investigations into AES field multiplication by 09 for the 8-bit field |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/Mul_e_4.hpp [code] | Investigations into AES field multiplication by arbitary elements (e) in the 4-bit field |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/Mul_e_8.hpp [code] | Investigations into AES field multiplication by arbitary elements (e) in the 8-bit field |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/RoundColumn_2_4.hpp [code] | Studying good representations of the combination of the AES SubBytes and MixColumns operations |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/Sbox_4.hpp [code] | Investigations into the 4-bit AES S-box |
Experimentation/Investigations/Cryptography/AdvancedEncryptionStandard/plans/Representations/Sbox_8.hpp [code] | Investigations into the AES S-box |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/general.hpp [code] | On investigations into the Data Encryption Standard |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/milestones.hpp [code] | |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/KeyDiscovery/1.hpp [code] | On investigations into the one-round Data Encryption Standard key discovery |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/KeyDiscovery/3.hpp [code] | On investigations into the 3-round Data Encryption Standard key discovery |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/KeyDiscovery/4.hpp [code] | On investigations into the 4-round Data Encryption Standard key discovery |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/KeyDiscovery/5.hpp [code] | On investigations into the 5-round Data Encryption Standard key discovery |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/KeyDiscovery/6.hpp [code] | On investigations into the 6-round Data Encryption Standard key discovery |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/KeyDiscovery/Argo.hpp [code] | On investigations into the Data Encryption Standard key discovery instances from the ARGO group |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/KeyDiscovery/general.hpp [code] | On investigations into the Data Encryption Standard key discovery |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/KeyDiscovery/KnownKeyBits.hpp [code] | On investigations into the full Data Encryption Standard key discovery where some key bits are known |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/Sboxes/general.hpp [code] | On investigations into the Data Encryption Standard |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/Sboxes/Sbox_1.hpp [code] | On investigations into Sbox one of the Data Encryption Standard |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/Sboxes/Sbox_2.hpp [code] | On investigations into Sbox two of the Data Encryption Standard |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/Sboxes/Sbox_3.hpp [code] | On investigations into Sbox three of the Data Encryption Standard |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/Sboxes/Sbox_4.hpp [code] | On investigations into Sbox four of the Data Encryption Standard |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/Sboxes/Sbox_5.hpp [code] | On investigations into Sbox five of the Data Encryption Standard |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/Sboxes/Sbox_6.hpp [code] | On investigations into Sbox six of the Data Encryption Standard |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/Sboxes/Sbox_7.hpp [code] | On investigations into Sbox seven of the Data Encryption Standard |
Experimentation/Investigations/Cryptography/DataEncryptionStandard/plans/Sboxes/Sbox_8.hpp [code] | On investigations into Sbox eight of the Data Encryption Standard |
Experimentation/Investigations/Cryptography/KeeLoq/plans/general.hpp [code] | On investigations into KeeLoq cipher |
Experimentation/Investigations/Cryptography/plans/general.hpp [code] | General plans regarding investigations into cryptographic systems |
Experimentation/Investigations/Groupoids/plans/general.hpp [code] | On investigations regarding groupoids and specialisations (semigroups, quasigroups etc.) |
Experimentation/Investigations/Groupoids/plans/Transformations.hpp [code] | On investigations regarding transformation semigroups |
Experimentation/Investigations/LatinSquares/plans/general.hpp [code] | On investigations regarding latin squares and variations |
Experimentation/Investigations/LatinSquares/plans/OrthogonalSquares.hpp [code] | On investigations regarding mutually orthogonal latin squares |
Experimentation/Investigations/LatinSquares/plans/SelfOrthogonal.hpp [code] | On investigations regarding self-orthogonal latin squares |
Experimentation/Investigations/LatinSquares/Sudoku/plans/EmptyPuzzle.hpp [code] | On investigations regarding "empty" Sudoku problems (just finding a solution) |
Experimentation/Investigations/LatinSquares/Sudoku/plans/general.hpp [code] | On investigations regarding Sudoku problems (standard, and extended) |
Experimentation/Investigations/LogicalDataAnalysis/plans/CarenPanofsky2005.hpp [code] | Plans regarding investigations of a case-study for the logical analysis of data with temporal relations |
Experimentation/Investigations/LogicalDataAnalysis/plans/general.hpp [code] | General plans regarding investigations on logical data analysis |
Experimentation/Investigations/LogicalDataAnalysis/plans/Marx2008.hpp [code] | Plans regarding investigations of a case-study for the logical analysis of data |
Experimentation/Investigations/LogicalDataAnalysis/plans/SnowCress2000Analysis.hpp [code] | Plans regarding investigations of a case-study for the logical analysis of data |
Experimentation/Investigations/MinimalUnsatisfiability/plans/general.hpp [code] | Plans regarding minimal unsatisfiable clause-sets |
Experimentation/Investigations/MinimalUnsatisfiability/plans/SingularDP.hpp [code] | Plans regarding singular DP-reduction for minimal unsatisfiable clause-sets |
Experimentation/Investigations/PigeonholeFormulas/plans/ExtendedResolution.hpp [code] | Investigations regarding extended resolution for pigeonhole clause-sets |
Experimentation/Investigations/PigeonholeFormulas/plans/general.hpp [code] | Investigations regarding pigeonhole clause-sets |
Experimentation/Investigations/PigeonholeFormulas/plans/Hardness.hpp [code] | Investigations regarding hardness of pigeonhole clause-sets |
Experimentation/Investigations/PigeonholeFormulas/plans/Measures.hpp [code] | Investigations regarding measurements for pigeonhole clause-sets |
Experimentation/Investigations/PigeonholeFormulas/plans/Resolution.hpp [code] | |
Experimentation/Investigations/PigeonholeFormulas/plans/SATSolving.hpp [code] | Investigations regarding SAT solvers for pigeonhole clause-sets |
Experimentation/Investigations/PigeonholeFormulas/plans/TreeResolution.hpp [code] | Investigations regarding tree resolution for pigeonhole clause-sets |
Experimentation/Investigations/plans/CurrentExperiments.hpp [code] | Overview on currently running experiments |
Experimentation/Investigations/plans/general.hpp [code] | Plans for the super-module for collecting data (not tools, but actual data) |
Experimentation/Investigations/plans/MaximiseMinVarDegrees.hpp [code] | Plans on investigations into the maximum of the min-var-degree of parameterised classes of unsatisfiable clause-sets |
Experimentation/Investigations/plans/milestones.hpp [code] | |
Experimentation/Investigations/plans/MinimiseMaxVarDegrees.hpp [code] | Plans on investigations into the minimum of the max-var-degree of parameterised classes of unsatisfiable clause-sets |
Experimentation/Investigations/plans/SATCompetition.hpp [code] | Plans regarding SAT competitions |
Experimentation/Investigations/plans/SelfDuality.hpp [code] | On investigations regarding self-dual {0,1}-matrices |
Experimentation/Investigations/RamseyTheory/FolkmanProblems/plans/general.hpp [code] | General plans regarding investigations on Folkman problems |
Experimentation/Investigations/RamseyTheory/GasarchProblems/plans/general.hpp [code] | On investigations into Gasarch problems (including Gasarch numbers) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/AdditiveNumberTheory.hpp [code] | On investigations into additive number theory |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/CountingProgressions.hpp [code] | On counting arithmetic progressions in the primes |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/general.hpp [code] | On investigations into Green-Tao problems (including Green-Tao numbers) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_2-3-6.hpp [code] | Investigations on greentao_2(3,6) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_2-3-7.hpp [code] | Investigations on greentao_2(3,7) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_2-3-k.hpp [code] | On investigations into Green-Tao numbers greentao_2(3,k) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_2-4-4.hpp [code] | Investigations on greentao_2(4) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_2-4-5.hpp [code] | Investigations on greentao_2(4,5) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_2-5-5.hpp [code] | Investigations on greentao_2(5) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_2-5-5_OKsolver.hpp [code] | Investigations on OKsolver for greentao_2(5) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_3-3-3-k.hpp [code] | On investigations into Green-Tao numbers greentao_3(3,3,k) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_3-3-4-k.hpp [code] | On investigations into Green-Tao numbers greentao_3(3,4,k) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_3-3.hpp [code] | Investigations on greentao_3(3) = 137 |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_3-4-4-k.hpp [code] | On investigations into Green-Tao numbers greentao_3(4,4,k) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_4-3-3-3-4.hpp [code] | Investigations on greentao_4(3,3,3,4) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_4-3-3-4-4.hpp [code] | Investigations on greentao_4(3,3,4,4) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_4-3.hpp [code] | Investigations on greentao_4(3) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_te_m-3-3-3.hpp [code] | Investigations regarding the "transversal extension" numbers greentao_{m+2}([2,...,2,3,3,3]) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_te_m-3-3-4.hpp [code] | Investigations regarding the "transversal extension" numbers greentao_{m+2}([2,...,2,3,3,4]) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_te_m-3-3.hpp [code] | Investigations regarding the "transversal extension" numbers greentao_{m+2}([2,...,2,3,3]) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_te_m-3-4.hpp [code] | Investigations regarding the "transversal extension" numbers greentao_{m+2}([2,...,2,3,4]) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_te_m-3-5.hpp [code] | Investigations regarding the "transversal extension" numbers greentao_{m+2}([2,...,2,3,5]) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/plans/GreenTao_te_m-4-4.hpp [code] | Investigations regarding the "transversal extension" numbers greentao_{m+2}([2,...,2,4,4]) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/Transversals/plans/Datak10.hpp [code] | Investigating the transversal hypergraph of Green-Tao hypergraphs for k = 10 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/Transversals/plans/Datak3.hpp [code] | Investigating the transversal hypergraph of Green-Tao hypergraphs for k = 3 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/Transversals/plans/Datak4.hpp [code] | Investigating the transversal hypergraph of Green-Tao hypergraphs for k = 4 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/Transversals/plans/Datak5.hpp [code] | Investigating the transversal hypergraph of Green-Tao hypergraphs for k = 5 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/Transversals/plans/Datak6.hpp [code] | Investigating the transversal hypergraph of Green-Tao hypergraphs for k = 6 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/Transversals/plans/Datak7.hpp [code] | Investigating the transversal hypergraph of Green-Tao hypergraphs for k = 7 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/Transversals/plans/Datak8.hpp [code] | Investigating the transversal hypergraph of Green-Tao hypergraphs for k = 8 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/Transversals/plans/Datak9.hpp [code] | Investigating the transversal hypergraph of Green-Tao hypergraphs for k = 9 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/Transversals/plans/general.hpp [code] | Investigating the transversal hypergraph of hypergraphs of arithmetic progressions in the primes |
Experimentation/Investigations/RamseyTheory/GreenTaoProblems/Transversals/plans/UsingSAT.hpp [code] | Investigating the transversal hypergraph of Green-Tao hypergraphs via SAT methods |
Experimentation/Investigations/RamseyTheory/HindmanProblems/plans/general.hpp [code] | General plans regarding investigations on Hindman problems |
Experimentation/Investigations/RamseyTheory/HindmanProblems/plans/Hindmani_2^a(2).hpp [code] | |
Experimentation/Investigations/RamseyTheory/plans/general.hpp [code] | General plans regarding investigations on Ramsey theory (Ramsey problems, van der Waerden problems, etc.) |
Experimentation/Investigations/RamseyTheory/RadoProblems/plans/general.hpp [code] | General plans regarding investigations on Rado problems |
Experimentation/Investigations/RamseyTheory/RamseyProblems/plans/AlgorithmSelection.hpp [code] | On best algorithms for Ramsey problems |
Experimentation/Investigations/RamseyTheory/RamseyProblems/plans/general.hpp [code] | On investigations into Ramsey problems |
Experimentation/Investigations/RamseyTheory/RamseyProblems/plans/Ramsey_2_3_10.hpp [code] | On investigations into Ramsey problems of the form ramsey_2^2(3,10) |
Experimentation/Investigations/RamseyTheory/RamseyProblems/plans/Ramsey_2_4_4.hpp [code] | On investigations into Ramsey problems of the form ramsey_2^2(4,4) |
Experimentation/Investigations/RamseyTheory/RamseyProblems/plans/Ramsey_2_4_6.hpp [code] | On investigations into Ramsey problems of the form ramsey_2^2(4,6) |
Experimentation/Investigations/RamseyTheory/RamseyProblems/plans/Ramsey_2_5_5.hpp [code] | On investigations into Ramsey problems of the form ramsey_2^2(5,5) |
Experimentation/Investigations/RamseyTheory/RamseyProblems/plans/SymmetryBreaking.hpp [code] | On performance of symmetry breaking techniques on Ramsey problems |
Experimentation/Investigations/RamseyTheory/SchurProblems/plans/general.hpp [code] | General plans regarding investigations on Schur problems (and generalisations) |
Experimentation/Investigations/RamseyTheory/SchurProblems/plans/Symmetry.hpp [code] | Symmetry for Schur problems (and generalisations) |
Experimentation/Investigations/RamseyTheory/SchurProblems/plans/Schur4/general.hpp [code] | |
Experimentation/Investigations/RamseyTheory/SchurProblems/plans/Schur5/general.hpp [code] | On computing schur(5) and variations |
Experimentation/Investigations/RamseyTheory/SchurProblems/plans/Schur5/CompleteSolvers/general.hpp [code] | On computing lower bounds for schur(5) and variations via complete DPLL-solvers |
Experimentation/Investigations/RamseyTheory/SchurProblems/plans/Schur5/CompleteSolvers/SplittingViaOKsolver.hpp [code] | On computing schur(5) and variations via Cube-and-Conquer |
Experimentation/Investigations/RamseyTheory/SchurProblems/plans/Schur5/LocalSearch/general.hpp [code] | On computing lower bounds for schur(5) and variations via local search |
Experimentation/Investigations/RamseyTheory/SchurProblems/plans/Schur6/general.hpp [code] | On computing schur(6) and variations |
Experimentation/Investigations/RamseyTheory/SchurProblems/Transversals/plans/Datak3.hpp [code] | Investigating the transversal hypergraph of Schur hypergraphs for k = 3 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/SchurProblems/Transversals/plans/general.hpp [code] | Investigating the transversal hypergraph of Schur hypergraphs |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/Factoring.hpp [code] | |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/general.hpp [code] | On investigations into van-der-Waerden problems |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/Tools.hpp [code] | On investigations into tools helping with solving van-der-Waerden problems |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/UsingSubProblems.hpp [code] | On how to use smaller vdW-problems (to use bigger ones) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/VanderWaerden_3-3-3-k.hpp [code] | On investigations into vdW-numbers vdw_3(3,3,k) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/VanderWaerden_3-3-4-k.hpp [code] | On investigations into vdW-numbers vdw_3(3,4,k) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/VanderWaerden_3-4-4-4.hpp [code] | On investigations into vdW-number vdw_3(4,4,4) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/VanderWaerden_4-3-3-3-3.hpp [code] | Investigating vanderwaerden_4(3,3,3,3) = 76 |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/14.hpp [code] | On investigations into vdw_2(3,14) = 186 |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/15.hpp [code] | On investigations into vdw_2(3,15) = 218 |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/16.hpp [code] | On investigations into vdw_2(3,16) = 238 |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/17.hpp [code] | On investigations into vdw_2(3,17) = 279 |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/18.hpp [code] | On investigations into vdw_2(3,18) = 312 |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/19.hpp [code] | On investigations into vdw_2(3,19) = 349 |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/20.hpp [code] | On investigations into vdw_2(3,20) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/21.hpp [code] | On investigations into vdw_2(3,21) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/22.hpp [code] | On investigations into vdw_2(3,22) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/23.hpp [code] | On investigations into vdw_2(3,23) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/24.hpp [code] | On investigations into vdw_2(3,24) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/25.hpp [code] | On investigations into vdw_2(3,25) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/26.hpp [code] | On investigations into vdw_2(3,26) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/27.hpp [code] | On investigations into vdw_2(3,27) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/28.hpp [code] | On investigations into vdw_2(3,28) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/29.hpp [code] | On investigations into vdw_2(3,29) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/30.hpp [code] | On investigations into vdw_2(3,30) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/31.hpp [code] | On investigations into vdw_2(3,31) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/32.hpp [code] | On investigations into vdw_2(3,32) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/33.hpp [code] | On investigations into vdw_2(3,33) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/34.hpp [code] | On investigations into vdw_2(3,34) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/35.hpp [code] | On investigations into vdw_2(3,35) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/36.hpp [code] | On investigations into vdw_2(3,36) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/37.hpp [code] | On investigations into vdw_2(3,37) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/38.hpp [code] | On investigations into vdw_2(3,38) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/39.hpp [code] | On investigations into vdw_2(3,39) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/general.hpp [code] | On investigations into vdW-numbers vdw_2(3,k) and pdvdw_2(3,k) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/SolversPdVdw.hpp [code] | On SAT solvers computing palindromic vdW-numbers pdvdw_2(3,k) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/SolversVdw.hpp [code] | On SAT solvers computing vdW-numbers vdw_2(3,k) in general |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/TawSolverPdVdw.hpp [code] | On tawSolver computing palindromic vdW-numbers pdvdw_2(3,k) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/3-k/TawSolverVdw.hpp [code] | On tawSolver computing vdW-numbers pdvdw_2(3,k) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/4-k/08.hpp [code] | On investigations into vdw_2(4,8) = 146 |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/4-k/09.hpp [code] | On investigations into vdw_2(4,9) >= 309 |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/4-k/10.hpp [code] | On investigations into vdw_2(4,10) > 328 |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/4-k/11.hpp [code] | On investigations into vdw_2(4,11) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/4-k/12.hpp [code] | On investigations into vdw_2(4,12) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/4-k/13.hpp [code] | On investigations into vdw_2(4,13) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/4-k/14.hpp [code] | On investigations into vdw_2(4,14) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/4-k/15.hpp [code] | On investigations into vdw_2(4,15) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/4-k/16.hpp [code] | On investigations into vdw_2(4,16) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/4-k/17.hpp [code] | On investigations into vdw_2(4,17) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/4-k/general.hpp [code] | On investigations into vdW-numbers vdw_2(4,k) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/5-k/06.hpp [code] | On investigations into vdw_2(5,6) = 206 |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/5-k/07.hpp [code] | On investigations into vdw_2(5,7) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/5-k/08.hpp [code] | On investigations into vdw_2(5,8) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/5-k/09.hpp [code] | On investigations into vdw_2(5,9) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/5-k/10.hpp [code] | On investigations into vdw_2(5,10) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/5-k/11.hpp [code] | On investigations into vdw_2(5,11) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/5-k/12.hpp [code] | On investigations into vdw_2(5,12) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/5-k/13.hpp [code] | On investigations into vdw_2(5,13) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/5-k/general.hpp [code] | On investigations into vdW-numbers vdw_2(5,k) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/6-k/06.hpp [code] | On investigations into vanderwaerden_2(6) = 1132 |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/6-k/07.hpp [code] | On investigations into vdw_2(6,7) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/6-k/08.hpp [code] | On investigations into vdw_2(6,8) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/6-k/09.hpp [code] | On investigations into vdw_2(6,9) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/6-k/general.hpp [code] | On investigations into vdW-numbers vdw_2(6,k) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/7-k/07.hpp [code] | On investigations into vdw_2(7,7) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/7-k/general.hpp [code] | On investigations into vdW-numbers vdw_2(7,k) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/plans/Parallelisation/general.hpp [code] | Using parallel SAT solving for van-der-Waerden problems |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak10.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 10 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak11.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 11 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak12.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 12 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak13.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 13 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak14.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 14 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak15.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 15 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak16.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 16 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak17.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 17 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak18.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 18 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak19.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 19 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak20.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 20 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak21.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 21 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak22.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 22 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak3.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 3 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak4.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 4 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak5.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 5 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak6.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 6 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak7.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 7 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak8.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 8 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/Datak9.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs for k = 9 (length of arithmetic progressions) |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/general.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/UsingPB.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs via PB methods |
Experimentation/Investigations/RamseyTheory/VanderWaerdenProblems/Transversals/plans/UsingSAT.hpp [code] | Investigating the transversal hypergraph of van-der-Waerden hypergraphs via SAT methods |
Experimentation/Investigations/Reductions/UnitClausePropagation/plans/general.hpp [code] | General plans on investigations into UCP |
Experimentation/Investigations/TenChallenges/01_QuantitativeHeuristics/plans/general.hpp [code] | Plans on the first challenge, to improve the quantitative understanding of heuristics (for DPLL-like algorithms) |
Experimentation/Investigations/TenChallenges/02_StatisticalMethods/plans/general.hpp [code] | Plans on the second challenge, to develop statistical methods forcasting the future of a solver run |
Experimentation/Investigations/TenChallenges/03_SAT-Combinatorics/plans/general.hpp [code] | Plans on the third challenge, to generalise methods from combinatorics, revealing their SAT-core |
Experimentation/Investigations/TenChallenges/04_AlgorithmicProofTheory/plans/general.hpp [code] | Plans on the fourth challenge, to develop an algorithmical proof theory useful for SAT solving |
Experimentation/Investigations/TenChallenges/05_MapsNPWorlds/plans/general.hpp [code] | Plans on the fifth challenge, to create maps of the universes of NP-problems and their connections |
Experimentation/Investigations/TenChallenges/06_GeneralisedSatisfiability/plans/general.hpp [code] | Plans on the sixth challenge, to develop a theory and a framework for "generalised satisfiability" |
Experimentation/Investigations/TenChallenges/07_AlgebraSAT/plans/general.hpp [code] | Plans on the seventh challenge, to bring together SAT with commutative algebra and algebraic geometry |
Experimentation/Investigations/TenChallenges/08_CombiningThreeParadigms/plans/general.hpp [code] | Plans on the eigth challenge, to combine the three main SAT solving paradigms ("look-ahead", "local search", "conflict-driven") in a novel algorithm |
Experimentation/Investigations/TenChallenges/09_PolySAT/plans/general.hpp [code] | Plans on the ninth challenge, to develop a framework to make poly-time classes and algorithms useful for practical SAT solving |
Experimentation/Investigations/TenChallenges/10_SoftwareEngineering/plans/general.hpp [code] | Plans on the tenth challenge, to develop sound software engineering methods appropriate for the world of hard problems (NP and beyond) |
Experimentation/Investigations/TenChallenges/plans/general.hpp [code] | General plans regarding the ten challenges for advancing SAT solving proposed by OK (Baltimore 2008) |
Experimentation/Investigations/Transversals/Bounded/plans/general.hpp [code] | Plans on investigating size-bounded transversals of hypergraphs |
Experimentation/Investigations/Transversals/plans/general.hpp [code] | Plans on investigating transversals of hypergraphs |
Experimentation/Investigations/UHittingCatalogue/plans/general.hpp [code] | Plans regarding building the catalogue of unsatisfiable non-singular hitting clause-sets of low deficiency |
Experimentation/Investigations/UHittingCatalogue/plans/ResolutionComplexity.hpp [code] | Plans regarding resolution-complexity of unsatisfiable hitting clause-sets |
Experimentation/Investigations/Visualisation/plans/general.hpp [code] | Plans regarding investigations of graph drawing |
Experimentation/Investigations/Visualisation/Trees/plans/general.hpp [code] | Plans regarding experiments with visualisation of trees |
Experimentation/plans/general.hpp [code] | Plans for the experimentation support in general |
Experimentation/plans/milestones.hpp [code] | |
Experimentation/RandomGenerator/BlockChiffAES.cpp [code] | Implementations regarding the AES chiffre |
Experimentation/RandomGenerator/BlockChiffAES.hpp [code] | Definitions related to the AES chiffre |
Experimentation/RandomGenerator/DeskriptorVerarbeitung.cpp [code] | Implementations regarding the experiment descriptors |
Experimentation/RandomGenerator/DeskriptorVerarbeitung.hpp [code] | Definitions regarding the experiment descriptors |
Experimentation/RandomGenerator/EinKlmGeneratorAES.cpp [code] | Implementations regarding the generator for a single clause-set |
Experimentation/RandomGenerator/EinKlmGeneratorAES.hpp [code] | Definitions regarding the generator for a single clause-set |
Experimentation/RandomGenerator/ExperimentDurchfuehrung.cpp [code] | Implementations regarding executing an experiment |
Experimentation/RandomGenerator/ExperimentDurchfuehrung.hpp [code] | Definitions regarding executing an experiment |
Experimentation/RandomGenerator/ExperimentUebertragung.cpp [code] | Implementations regarding transferring an experiment to the database |
Experimentation/RandomGenerator/ExperimentUebertragung.hpp [code] | Definitions regarding transferring an experiment to the database |
Experimentation/RandomGenerator/ExperimentVorbereitung.cpp [code] | Implementations regarding preparing an experiment |
Experimentation/RandomGenerator/ExperimentVorbereitung.hpp [code] | Definitions regarding preparing an experiment |
Experimentation/RandomGenerator/flint.c [code] | |
Experimentation/RandomGenerator/flint.h [code] | |
Experimentation/RandomGenerator/flintpp.cpp [code] | |
Experimentation/RandomGenerator/flintpp.h [code] | |
Experimentation/RandomGenerator/LiteralGeneratorAES.cpp [code] | Implementations regarding the basic literal generator |
Experimentation/RandomGenerator/LiteralGeneratorAES.hpp [code] | Definitions regarding the basic literal generator |
Experimentation/RandomGenerator/OKgenerator.cpp [code] | The OKgenerator |
Experimentation/RandomGenerator/Tools.hpp [code] | Various tools |
Experimentation/RandomGenerator/VEinKlmGeneratorAES.cpp [code] | Implementations regarding the generator for single non-boolean clause-sets |
Experimentation/RandomGenerator/VEinKlmGeneratorAES.hpp [code] | Definitions regarding the generator for single non-boolean clause-sets |
Experimentation/RandomGenerator/VLiteralGeneratorAES.cpp [code] | Implementations regarding the basic generator for non-boolean literals |
Experimentation/RandomGenerator/VLiteralGeneratorAES.hpp [code] | Definitions regarding the basic generator for non-boolean literals |
Experimentation/RandomGenerator/plans/general.hpp [code] | Plans regarding the random generation of problem instances |
Experimentation/RandomGenerator/plans/milestones.hpp [code] | |
General/Algebra_Applications_ModulareExponentiation.cpp [code] | Used for CS-232 |
General/Algebra_Applications_RSA.cpp [code] | Used for CS-232 |
General/Algebra_Concepts_tests.hpp [code] | |
General/Algebra_Models.hpp [code] | Deprecated (that is, to be "upgraded" and replaced). Contains Z_mod_n<modules, Int> and Zmodn<Int> for modular arithmetic (in the first case the modulus is fixed at compile time), and RSA<Int> for RSA-encryption and decryption (given the private key) |
General/Algebra_Testobjects.hpp [code] | |
General/Algebra_Traits.hpp [code] | |
General/Algorithms.hpp [code] | Collection of various basic generic algorithms |
General/Algorithms_Testobjects.hpp [code] | |
General/Algorithms_Tests.hpp [code] | |
General/AutomatedCompilation.hpp [code] | |
General/CgiHandling.hpp [code] | |
General/Combinatorics.hpp [code] | Tools for elementary counting and enumeration |
General/Combinatorics_Testobjects.hpp [code] | |
General/Combinatorics_Tests.hpp [code] | Tests for the elementary counting and enumeration tools |
General/DatabaseHandler01.hpp [code] | |
General/emailHandling.hpp [code] | |
General/EndlAuto.cpp [code] | |
General/EndlAuto.hpp [code] | |
General/ErrorHandling.hpp [code] | |
General/FunctionHandling.hpp [code] | |
General/IteratorHandling.hpp [code] | Tools for handling of iterators |
General/IteratorHandling_Testobjects.hpp [code] | |
General/IteratorHandling_Tests.hpp [code] | Tests for the tools for handling iterators |
General/Kommandozeile.cpp [code] | |
General/Kommandozeile.hpp [code] | Header file for the old program-options-scaffolding |
General/Matrices.hpp [code] | Simple class template for square matrices, as a wrapper around arrays |
General/MessageHandling.hpp [code] | |
General/NumberTheory_Application_gcd.cpp [code] | Used for CS-232 |
General/NumberTheory_Concept_test.hpp [code] | |
General/NumberTheory_Models.hpp [code] | Deprecated (to be replaced). Contains functors performing the Euclidian algorithm, and a brute-force computation of Euler's phi-function |
General/NumberTheory_Testobjects.hpp [code] | |
General/NumberTheory_Traits.hpp [code] | |
General/NumericalLimits.hpp [code] | |
General/Numerics.hpp [code] | |
General/Numerics_Testobjects.hpp [code] | |
General/Numerics_Tests.hpp [code] | Old tests for numeric operations (still using asserts) |
General/StreamHandling.hpp [code] | |
General/StringHandling.hpp [code] | Various tools for handling strings |
General/SystemHandling.hpp [code] | System calls |
General/TestBibliothek.cpp [code] | |
General/TimeHandling.hpp [code] | Tools for handling times and dates |
General/TimeHandling_Applications_DaysDifference.cpp [code] | |
General/TimeHandling_Applications_DifferenceList.cpp [code] | |
General/XercesTools.hpp [code] | |
General/XMLHandling.hpp [code] | Simple tools for writing XML-code |
General/plans/General.hpp [code] | Plans for the (old) module on "general" components |
General/plans/milestones.hpp [code] | |
Logic/AutomatedTheoremProving/plans/general.hpp [code] | General plans about automated-theorem-proving tools |
Logic/AutomatedTheoremProving/SetTheory/NeumannBernaysGoedel/plans/general.hpp [code] | General plans about formalising NBG |
Logic/AutomatedTheoremProving/SetTheory/plans/general.hpp [code] | General plans about set theory and ATP |
Logic/BoundedArithmetic/plans/general.hpp [code] | General plans about implementations for bounded arithmetic |
Logic/ComplexityTheory/plans/general.hpp [code] | Plans for the module on complexity theoretical constructions |
Logic/ComplexityTheory/plans/milestones.hpp [code] | |
Logic/Computability/plans/general.hpp [code] | General plans regarding computability issues |
Logic/Computability/plans/TuringMachines.hpp [code] | Plans on implementations around Turing Machines |
Logic/docus/general.hpp [code] | |
Logic/FiniteModelTheory/plans/general.hpp [code] | General plans regarding finite model theory |
Logic/FirstOrderLogic/plans/general.hpp [code] | General plans regarding first order logic |
LogicalReflection/docus/general.hpp [code] | |
LogicalReflection/FormalisedProofs/plans/FundamentalADTs.hpp [code] | Plans for the fundamental abstract data types for problem instances |
LogicalReflection/FormalisedProofs/plans/general.hpp [code] | Plans for the module on verified components, assisted upper bounds proofs etc |
LogicalReflection/FormalisedProofs/plans/LBounds.hpp [code] | Plans for the verification of L-bounds (number of literal occurrences) for SAT-decision |
LogicalReflection/FormalisedProofs/plans/UpperBounds.hpp [code] | Plans on how to formalise (and automatise) upper bounds proofs |
LogicalReflection/ProofAssistants/plans/general.hpp [code] | Plans regarding the usage of proof assistants |
OKsolver/Experimental/AllgKlassen200203/AlgebraicStructures.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/Auxiliary.hpp [code] | Experimental code regarding 3-valued types |
OKsolver/Experimental/AllgKlassen200203/Clauses.hpp [code] | Experimental code for clauses |
OKsolver/Experimental/AllgKlassen200203/ClauseSets.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/ConceptDefinitions.hpp [code] | First approaches for concepts in the framework of the library |
OKsolver/Experimental/AllgKlassen200203/Concepts_General.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/Concepts_Variables.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/Domains.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/InputCls.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/Literal.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/Literals.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/LitSets.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/OutputCls.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/PartialAssignments.hpp [code] | Models of partial assignments |
OKsolver/Experimental/AllgKlassen200203/SetsOfVariables.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/TestAllgKlassen.cpp [code] | Test old experimental classes |
OKsolver/Experimental/AllgKlassen200203/Tests_General.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/Tests_Variables.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/Traits_General.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/Traits_Variables.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/TransformationsBiclique.hpp [code] | Components for transforming the problem of finding a biclique partitioning of size at most max_bc for a multigraph given by its adjacency matrix |
OKsolver/Experimental/AllgKlassen200203/Values.hpp [code] | |
OKsolver/Experimental/AllgKlassen200203/Variables.hpp [code] | First approaches for models of concept Variables in the framework of the library |
OKsolver/plans/general.hpp [code] | Plans for the deprecated module containing old experimental code |
Optimisation/docus/general.hpp [code] | |
Optimisation/LocalSearch/plans/general.hpp [code] | Plans for local search algorithms in general |
plans/Annotations.hpp [code] | Plans for the Annotations-part of the OKlibrary, where latex-documents are handled |
plans/Foundations.hpp [code] | The general principles of the OKlibrary |
plans/general.hpp [code] | Plans for the library which do not belong to a single module |
plans/milestones.hpp [code] | Milestones for the OKlibrary |
plans/tickets/general.hpp [code] | Plans regarding the ticket system |
Programming/declarations.hpp [code] | |
Programming/docus/general.hpp [code] | Central docus-file for the part concerned with tools about general programming |
Programming/ErrorHandling/plans/general.hpp [code] | Plans for error handling |
Programming/InputOutput/IOStreamFilters.hpp [code] | Filters according to the Boost Iostream library |
Programming/InputOutput/IOStreamFilters_Testobjects.hpp [code] | |
Programming/InputOutput/IOStreamFilters_Tests.hpp [code] | Tests for iostream-filters |
Programming/InputOutput/IOStreamSinks.hpp [code] | Output devices according to the Boost Iostream library |
Programming/InputOutput/IOStreamSinks_Testobjects.hpp [code] | |
Programming/InputOutput/IOStreamSinks_Tests.hpp [code] | Testing the output devices |
Programming/InputOutput/MatchFiles.cpp [code] | Application for checking whether one file matches a regular expresssion |
Programming/InputOutput/Multiplexer.hpp [code] | Components for gathering and distributing input and output from and to different streams |
Programming/InputOutput/Multiplexer_Testobjects.hpp [code] | |
Programming/InputOutput/Multiplexer_Tests.hpp [code] | Testing of components for gathering and distributing input and output from and to different streams |
Programming/InputOutput/PathDifference.cpp [code] | Application for computing the relative path from one location to another |
Programming/InputOutput/RecursiveDirectoryIteration.hpp [code] | Recursive iteration over the files and subdirectories contained within a filesystem directory |
Programming/InputOutput/RecursiveDirectoryIteration_Testobjects.hpp [code] | |
Programming/InputOutput/RecursiveDirectoryIteration_Tests.hpp [code] | Tests for recursive directory iteration |
Programming/InputOutput/TestGeneralInputOutput.cpp [code] | |
Programming/InputOutput/plans/general.hpp [code] | Plans for the module on general input and output facilities |
Programming/InputOutput/plans/milestones.hpp [code] | |
Programming/InputOutput/TestDirectory/Test_001.hpp [code] | |
Programming/InputOutput/TestDirectory/TestSubDirectory/Test_002.hpp [code] | |
Programming/Iterators/ImplicitConversionsBoost.hpp [code] | Extending boost iterators by implicit conversions |
Programming/Iterators/ImplicitConversionsBoost_Testobjects.hpp [code] | |
Programming/Iterators/ImplicitConversionsBoost_Tests.hpp [code] | Tests for the extensions of boost iterators by implicit conversions |
Programming/Iterators/TestIterators.cpp [code] | |
Programming/Iterators/plans/general.hpp [code] | Plans for the iterators module |
Programming/Iterators/plans/milestones.hpp [code] | |
Programming/Messages/demo_Messages_1.cpp [code] | Demonstration of basic usage of Messages-components |
Programming/Messages/demo_Messages_2.cpp [code] | Further demonstration of basic usage of Messages-components |
Programming/Messages/demo_Messages_3.cpp [code] | Demonstration of usage of Messages-components (with potential compilation error in case of missing implementations) |
Programming/Messages/LanguageNames.hpp [code] | Component for translating language names (as C-strings) into language constants (as C++ enumerated constants) |
Programming/Messages/Languages.hpp [code] | Definitions for identification and handling of (natural) languages supported by the library |
Programming/Messages/Levels.hpp [code] | Definition of the level system (as used by messages) |
Programming/Messages/LineHandling.hpp [code] | General message-class for line-start and line-end handling |
Programming/Messages/Messages_Testapplication.cpp [code] | Temporary test application |
Programming/Messages/MessagesBase.hpp [code] | The base class of the messages framework |
Programming/Messages/MessagesMain.hpp [code] | The complete messages framework (including the macro support) |
Programming/Messages/messages/Languages.hpp [code] | Explanations of language names |
Programming/Messages/messages/Levels.hpp [code] | Translations of level names (provided by a message class) |
Programming/Messages/plans/general.hpp [code] | Plans for the messages module (as a whole) |
Programming/Messages/plans/LanguageNames.hpp [code] | Plans for the module handling language names |
Programming/Messages/plans/Languages.hpp [code] | Plans for the module providing definitions for the available languages |
Programming/Messages/plans/Levels.hpp [code] | Plans for the module providing the level system for messages |
Programming/Messages/plans/LineHandling.hpp [code] | Plans regarding the line-handling message-classes |
Programming/Messages/plans/MessagesBase.hpp [code] | Plans for the module providing the base class for messages |
Programming/Messages/plans/MessagesMain.hpp [code] | Plans for the module providing the framework for messages |
Programming/Messages/plans/milestones.hpp [code] | |
Programming/Messages/Utilities/FileIdentification.hpp [code] | Message class to provide source-code-file information |
Programming/Messages/Utilities/LineIdentification.hpp [code] | Message class to provide source-code line-number information, plus supporting macro |
Programming/Messages/Utilities/TimeAndDate.hpp [code] | Message classes for time and date representation |
Programming/Messages/Utilities/TrivialMessage.hpp [code] | Components to wrap a streamable object as a message object |
Programming/Messages/Utilities/Umlaute.hpp [code] | Macros defining the UTF-8 code sequences for the seven special German characters |
Programming/Messages/Utilities/plans/FileIdentification.hpp [code] | Plans for the file identification utilities |
Programming/Messages/Utilities/plans/general.hpp [code] | General plans for the Messages/Utilities module |
Programming/Messages/Utilities/plans/milestones.hpp [code] | |
Programming/Messages/Utilities/plans/TimeAndDate.hpp [code] | Plans for the messages-utility module on time-and-date components |
Programming/MetaProgramming/Logical.hpp [code] | Logical metafunctions, and some macros for defining metafunctions |
Programming/MetaProgramming/Logical_Testobjects.hpp [code] | |
Programming/MetaProgramming/Logical_Tests.hpp [code] | |
Programming/MetaProgramming/Numerical.hpp [code] | Numerical metafunctions |
Programming/MetaProgramming/Numerical_Testobjects.hpp [code] | |
Programming/MetaProgramming/Numerical_Tests.hpp [code] | Tests for numerical metafunctions |
Programming/MetaProgramming/TaggingPolymorphism.hpp [code] | |
Programming/MetaProgramming/TaggingPolymorphism_Testobjects.hpp [code] | |
Programming/MetaProgramming/TaggingPolymorphism_Tests.hpp [code] | |
Programming/MetaProgramming/TestMetaProgramming.cpp [code] | |
Programming/MetaProgramming/plans/general.hpp [code] | Plans for the metaprogramming supermodule |
Programming/MetaProgramming/plans/milestones.hpp [code] | |
Programming/Parallelism/demo_Example_12_1.cpp [code] | Example program according to [C++ Cookbook], problem 12.1 |
Programming/Parallelism/ExperimentalThreads.hpp [code] | Experiments using the Boost::Threads library |
Programming/Parallelism/ExperimentalThreads_Testobjects.hpp [code] | Testobjects for testing parallelism |
Programming/Parallelism/ExperimentalThreads_Tests.hpp [code] | Test metafunctions |
Programming/Parallelism/TestParallelism.cpp [code] | |
Programming/Parallelism/plans/general.hpp [code] | Plans for the module on parallelism |
Programming/Parallelism/plans/milestones.hpp [code] | |
Programming/Parsing/ParserBase.hpp [code] | Base class for parsers in the Boost::Spirit framework |
Programming/Parsing/ParserBase_Testobjects.hpp [code] | |
Programming/Parsing/ParserBase_Tests.hpp [code] | Tools for testing parsers |
Programming/Parsing/TestParser.cpp [code] | |
Programming/Parsing/plans/general.hpp [code] | Plans for the parsing modules |
Programming/Parsing/plans/milestones.hpp [code] | |
Programming/plans/general.hpp [code] | General plans regarding the programming part |
Programming/ProgramOptions/plans/general.hpp [code] | Plans for the module on program options (as a whole) |
Programming/ProgramOptions/plans/milestones.hpp [code] | |
Programming/Refactoring/BoostPathCorrected.hpp [code] | Adding missing functionality to Boost::filesystem::path |
Programming/Refactoring/IncludeHandling.hpp [code] | Refactoring of include directives in C and C++ programs |
Programming/Refactoring/IncludeHandling_Testobjects.hpp [code] | |
Programming/Refactoring/IncludeHandling_Tests.hpp [code] | Tests regarding include statement handling |
Programming/Refactoring/TestRefactoring.cpp [code] | |
Programming/Refactoring/plans/general.hpp [code] | Plans for the module on refactoring |
Programming/Refactoring/plans/milestones.hpp [code] | |
Programming/Refactoring/plans/Renaming.hpp [code] | Tools for replacing names |
Programming/Refactoring/traits/size_type.hpp [code] | Traits-metafunctions to extract the size type |
Programming/Refactoring/traits/string_type.hpp [code] | Traits-metafunctions to extract the string type |
Programming/Sequences/Comparisons.hpp [code] | Generic algorithms for comparing sequences |
Programming/Sequences/declarations.hpp [code] | |
Programming/Sequences/_Comparisons/CommonPart.hpp [code] | Generic algorithm for finding the common prefix of two sequences |
Programming/Sequences/plans/Comparisons.hpp [code] | Plans regarding generic algorithms for comparing sequences |
Programming/Sequences/plans/general.hpp [code] | General plans regarding generic algorithms for sequences |
Programming/Sequences/plans/milestones.hpp [code] | |
Programming/Sequences/testobjects/Comparisons.cpp [code] | |
Programming/Sequences/tests/Comparisons.hpp [code] | Generic tests for algorithms comparing sequences |
Programming/SystemSpecifics/demangle.h [code] | Adaptation for the OKlibrary |
Programming/SystemSpecifics/Demangling.hpp [code] | Translating type names in a readable form |
Programming/SystemSpecifics/libiberty.h [code] | |
Programming/SystemSpecifics/plans/Demangling.hpp [code] | Plans for the module SystemSpecifics/Demangling.hpp |
Programming/SystemSpecifics/plans/general.hpp [code] | Plans for the module with system-specific components/tools |
Programming/SystemSpecifics/plans/milestones.hpp [code] | |
Programming/SystemSpecifics/plans/SafeReading.hpp [code] | Plans for testing of reading fundamental types from istreams (for example, whether input representing nonrepresentable numbers are regocnised) |
Programming/Teaching/PhilosophicalCpp/docus/general.hpp [code] | Central docus for teaching C++ "philosophically" |
Programming/Teaching/PhilosophicalCpp/Part01_Basics/Chapter1_SimplePrograms/docus/general.hpp [code] | Central docus for Chapter 1 on "simple programs" |
Programming/Teaching/PhilosophicalCpp/Part01_Basics/Chapter1_SimplePrograms/EmptyProgram/EmptyProgram.cpp [code] | Just returning 0 |
Programming/Teaching/PhilosophicalCpp/Part01_Basics/Chapter1_SimplePrograms/EmptyProgram/docus/general.hpp [code] | Documentation on the empty program |
Programming/Teaching/PhilosophicalCpp/Part01_Basics/docus/general.hpp [code] | Central docus for Part 1 on the basics |
Programming/Teaching/PhilosophicalCpp/plans/general.hpp [code] | General plans on teaching C++ "philosophically" |
Programming/Tools/plans/general.hpp [code] | General plans regarding programming tools |
Programming/Utilities/LaTeX/Doc_Object_Implementation.hpp [code] | |
Programming/Utilities/LaTeX/Latex_Handler_Implementation.hpp [code] | |
Programming/Utilities/LaTeX/plans/general.hpp [code] | Plans for the LaTeX-Module |
Programming/Utilities/OrderRelations/DerivedRelations.hpp [code] | Functors and macros for order and comparison relations derived from < and == in the standard way |
Programming/Utilities/OrderRelations/OrderConstructions.hpp [code] | Components for the construction of order relations |
Programming/Utilities/OrderRelations/plans/general.hpp [code] | Plans for the module on order relations |
Programming/Utilities/OrderRelations/plans/milestones.hpp [code] | |
Programming/Utilities/plans/general.hpp [code] | General plans for the utilities module |
Programming/Utilities/TimeStamps/plans/general.hpp [code] | Plans for the timestamp module |
Satisfiability/Algorithms/AllSolutions/plans/Enumeration.hpp [code] | Solving SAT via enumeration of all total assignments |
Satisfiability/Algorithms/AllSolutions/plans/general.hpp [code] | Plans for the module on components for finding all satisfying assignments |
Satisfiability/Algorithms/AllSolutions/plans/milestones.hpp [code] | |
Satisfiability/Algorithms/AllSolutions/plans/MinimalAssignments.hpp [code] | Plans for computing the generalised "transversal hypergraph" |
Satisfiability/Algorithms/Autarkies/MatchingAutarkies/plans/general.hpp [code] | Plans for algorithms regarding matching autarkies |
Satisfiability/Algorithms/Autarkies/MatchingAutarkies/plans/milestones.hpp [code] | |
Satisfiability/Algorithms/Autarkies/plans/general.hpp [code] | General plans on autarkies |
Satisfiability/Algorithms/Autarkies/plans/milestones.hpp [code] | |
Satisfiability/Algorithms/Autarkies/Search/AnalyseTotalAssignment.hpp [code] | Components regarding the determination of the largest autarky inside some total (or partial) assignment |
Satisfiability/Algorithms/Autarkies/Search/plans/AnalyseTotalAssignment.hpp [code] | Decision, whether a given partial assignment contains an autarky, and applications for autarky search (via enumeration of all total assignments, or local search through total assignments) |
Satisfiability/Algorithms/Autarkies/Search/plans/EvaluatePartialAssignments.hpp [code] | Evaluation of partial assignments, computing a heuristical value of how close the assignment is to an autarky for a given clause-set |
Satisfiability/Algorithms/Autarkies/Search/plans/general.hpp [code] | Plans for the module on autarky search |
Satisfiability/Algorithms/Autarkies/Search/plans/milestones.hpp [code] | |
Satisfiability/Algorithms/Backdoors/plans/2CNF.hpp [code] | Plans on the module for backdoor algorithms targeting 2CNF |
Satisfiability/Algorithms/Backdoors/plans/general.hpp [code] | Plans on the module for backdoor algorithms in general |
Satisfiability/Algorithms/Backdoors/plans/Horn.hpp [code] | Plans on the module for backdoor algorithms targeting Horn |
Satisfiability/Algorithms/Backdoors/plans/milestones.hpp [code] | |
Satisfiability/Algorithms/Backtracking/DLL_Algorithms.cpp [code] | Old, very simple implementation of a general (boolean) DLL-SAT-algorithms |
Satisfiability/Algorithms/Backtracking/DLL_Algorithms.hpp [code] | Old, very simple interface for (boolean) DLL-SAT-algorithms |
Satisfiability/Algorithms/Backtracking/GenericBacktracking.hpp [code] | Generic backtracking (DPLL-like) solvers |
Satisfiability/Algorithms/Backtracking/plans/general.hpp [code] | General plans on generic backtracking algorithms, their concepts and implementations |
Satisfiability/Algorithms/Backtracking/plans/GenericBacktracking.hpp [code] | Plans for the old module on generic backtracking algorithms |
Satisfiability/Algorithms/Backtracking/plans/milestones.hpp [code] | |
Satisfiability/Algorithms/Backtracking/testobjects/GenericBacktracking.cpp [code] | |
Satisfiability/Algorithms/Backtracking/tests/GenericBacktracking.hpp [code] | Tests for generic backtracking (DPLL-like) solvers |
Satisfiability/Algorithms/GraphDecomposition/plans/general.hpp [code] | Plans for the module regarding SAT decision by means of graph decomposition |
Satisfiability/Algorithms/Learning/plans/general.hpp [code] | Plans for the module on clause-learning |
Satisfiability/Algorithms/Learning/plans/milestones.hpp [code] | |
Satisfiability/Algorithms/LocalSearch/plans/general.hpp [code] | Plans for the general module on local search |
Satisfiability/Algorithms/LocalSearch/plans/milestones.hpp [code] | |
Satisfiability/Algorithms/LocalSearch/plans/SupportTotalAssignments.hpp [code] | Supporting data structures for total assignments to be used for efficient enumeration and local search (for satisfying assignments as well as autarkies). Operations to support variable flips |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/novelty.c [code] | Problematic pointer handling, needs correction |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/parameters.c [code] | |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/reports.c [code] | |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/rots.c [code] | |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/ubcsat-globals.h [code] | Added include-guard, and changed variable types of bSolutionFound and pBool |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/ubcsat-help.c [code] | |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/ubcsat-internal.c [code] | Changed variable types of bSolutionFound, pBool and bReportStateMOnly, added pointer-casts to sscanf-calls, and added default-case to switch-statement |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/ubcsat-internal.h [code] | Added include-guard, and changed variable types of bReportOutputSupress and bReportStateLMOnly |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/ubcsat-io.c [code] | Return type of function genrand_int32 changed from unsigned long to UINT32 |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/ubcsat-limits.h [code] | Some constants have too small default values; also added include-guard |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/ubcsat-lit.h [code] | Include-guard added |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/ubcsat-reports.c [code] | Type of variable bReportOutputSupress changed, and default-case added to switch-statement |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/ubcsat-triggers.h [code] | Include-guard added |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/ubcsat-types.h [code] | Corrected definition of fundamental types for UBCSAT |
Satisfiability/Algorithms/LocalSearch/Ubcsat/corrected/ubcsat.c [code] | Flushing now always the output |
Satisfiability/Algorithms/LocalSearch/Ubcsat/local/ubcsat-globals.h [code] | Added include-guard, and global variable pActiveAlgorithm declared as extern (while all declaration are marked as "C"-linkage) |
Satisfiability/Algorithms/LocalSearch/Ubcsat/local/ubcsat.h [code] | The fundamental header for of UBCSAT (now with include-guard); for the local version defining ALTERNATEMAIN |
Satisfiability/Algorithms/LocalSearch/Ubcsat/plans/general.hpp [code] | Plans regarding Ubcsat |
Satisfiability/Algorithms/plans/general.hpp [code] | Plans on the supermodule on SAT algorithms in general |
Satisfiability/Algorithms/plans/milestones.hpp [code] | |
Satisfiability/Algorithms/SumProduct/plans/general.hpp [code] | Plans for the module on SumProduct components |
Satisfiability/Algorithms/SumProduct/plans/Marginalisation.hpp [code] | Generic marginalisation (brute-force) |
Satisfiability/Algorithms/SumProduct/plans/milestones.hpp [code] | |
Satisfiability/Assignments/concepts/plans/general.hpp [code] | Plans for concepts for (total) assignments |
Satisfiability/Assignments/PartialAssignments/ApplyPass.cpp [code] | Application for applying partial assignments |
Satisfiability/Assignments/PartialAssignments/Boolean.hpp [code] | Partial assignments for boolean literals |
Satisfiability/Assignments/PartialAssignments/MultivaluedPartialAssignments.hpp [code] | Components for set-valued partial assignments |
Satisfiability/Assignments/PartialAssignments/PartAssign.hpp [code] | Old, very simple implementation of partial boolean assignments |
Satisfiability/Assignments/PartialAssignments/PassClashes.cpp [code] | Application for checking whether two partial assignments clash |
Satisfiability/Assignments/PartialAssignments/PassExtends.cpp [code] | Application for checking whether one partial assignment extends another |
Satisfiability/Assignments/PartialAssignments/concepts/plans/general.hpp [code] | Plans for concepts for partial assignments |
Satisfiability/Assignments/PartialAssignments/plans/Boolean.hpp [code] | Plans for for boolean partial assignments |
Satisfiability/Assignments/PartialAssignments/plans/general.hpp [code] | Plans for the module on partial assignments |
Satisfiability/Assignments/PartialAssignments/plans/milestones.hpp [code] | |
Satisfiability/Assignments/PartialAssignments/plans/MultivaluedPartialAssignments.hpp [code] | Plans regarding set-valued partial assignments |
Satisfiability/Assignments/PartialAssignments/testobjects/Boolean.cpp [code] | |
Satisfiability/Assignments/PartialAssignments/testobjects/MultivaluedPartialAssignments.cpp [code] | |
Satisfiability/Assignments/PartialAssignments/tests/MultivaluedPartialAssignments.hpp [code] | Tests for set-valued partial assignments |
Satisfiability/Assignments/plans/general.hpp [code] | General plans on (partial and total) assignments, their concepts and implementations |
Satisfiability/Assignments/plans/milestones.hpp [code] | |
Satisfiability/Assignments/TotalAssignments/AssignmentsWithBuffer.hpp [code] | Components for assignments with buffers (for processing of single assignments) |
Satisfiability/Assignments/TotalAssignments/plans/general.hpp [code] | General plans on total assignments |
Satisfiability/Assignments/TotalAssignments/testobjects/AssignmentsWithBuffer.cpp [code] | |
Satisfiability/Assignments/TotalAssignments/tests/AssignmentsWithBuffer.hpp [code] | Generic tests for components implementing assignments with buffers |
Satisfiability/docus/general.hpp [code] | Central docus-file for the satisfiability part |
Satisfiability/Enumeration/plans/general.hpp [code] | Plans on the supermodule on counting, enumerating and sampling SAT problems |
Satisfiability/Enumeration/plans/milestones.hpp [code] | |
Satisfiability/Enumeration/plans/SubClauseSets.hpp [code] | Tools for running through sub-clause-sets of a clause-sets and evaluating them |
Satisfiability/FiniteFunctions/QuineMcCluskey-n16.cpp [code] | |
Satisfiability/FiniteFunctions/QuineMcCluskey-n4.cpp [code] | |
Satisfiability/FiniteFunctions/QuineMcCluskey.cpp [code] | Application for computing all minimal resolvents for a full clause-set |
Satisfiability/FiniteFunctions/QuineMcCluskey.hpp [code] | Components for computing all minimal resolvents of a full clause-set |
Satisfiability/FiniteFunctions/QuineMcCluskeySubsumptionHypergraph-n16.cpp [code] | |
Satisfiability/FiniteFunctions/QuineMcCluskeySubsumptionHypergraph-n4.cpp [code] | |
Satisfiability/FiniteFunctions/QuineMcCluskeySubsumptionHypergraph.cpp [code] | Application for computing the subsumption hypergraph of the prime clauses of a full clause-set |
Satisfiability/FiniteFunctions/QuineMcCluskeySubsumptionHypergraphFullStatistics-n16.cpp [code] | |
Satisfiability/FiniteFunctions/QuineMcCluskeySubsumptionHypergraphFullStatistics-n4.cpp [code] | |
Satisfiability/FiniteFunctions/QuineMcCluskeySubsumptionHypergraphFullStatistics.cpp [code] | Application for computing the statistics on the subsumption hypergraph of the prime clauses of a full clause-set |
Satisfiability/FiniteFunctions/QuineMcCluskeySubsumptionHypergraphWithFullStatistics-n16.cpp [code] | |
Satisfiability/FiniteFunctions/QuineMcCluskeySubsumptionHypergraphWithFullStatistics-n4.cpp [code] | |
Satisfiability/FiniteFunctions/QuineMcCluskeySubsumptionHypergraphWithFullStatistics.cpp [code] | Application for computing the subsumption hypergraph of the prime clauses of a full clause-set as well as statistics |
Satisfiability/FiniteFunctions/docus/general.hpp [code] | User documentation regarding "finite functions" |
Satisfiability/FiniteFunctions/docus/QuineMcCluskey.hpp [code] | Docus for the QuineMcCluskey implementation for finding prime implicates |
Satisfiability/FiniteFunctions/plans/general.hpp [code] | Super-module for finite functions (especially boolean functions) |
Satisfiability/FiniteFunctions/plans/milestones.hpp [code] | |
Satisfiability/FiniteFunctions/plans/QuineMcCluskey.hpp [code] | Plans regarding the direct implementation of the computation of the minimal elements of the resolution closure of full boolean clause-sets |
Satisfiability/FiniteFunctions/plans/QuineMcCluskeySubsumptionHypergraph.hpp [code] | Plans regarding the direct implementation of the computation of the subsumption hypergraph for computing minimal representations of full boolean clause-sets |
Satisfiability/FiniteFunctions/testobjects/QuineMcCluskey.cpp [code] | |
Satisfiability/FiniteFunctions/tests/QuineMcCluskey.hpp [code] | |
Satisfiability/Heuristics/plans/general.hpp [code] | Super-module for heuristics |
Satisfiability/Heuristics/plans/milestones.hpp [code] | |
Satisfiability/Heuristics/Projections/plans/general.hpp [code] | Module for projections (making branching tuples comparable) |
Satisfiability/Heuristics/Projections/plans/milestones.hpp [code] | |
Satisfiability/Heuristics/Projections/plans/MultipleParameters.hpp [code] | Plans regarding the use of multiple parameters |
Satisfiability/Heuristics/Projections/plans/TauMethod.hpp [code] | Plans regarding the tau-projection |
Satisfiability/Heuristics/StatisticalAnalysis/plans/BacktrackingProbing.hpp [code] | Submodule for tools supporting probing as proposed by Donald Knuth |
Satisfiability/Heuristics/StatisticalAnalysis/plans/general.hpp [code] | Module with statistical analysis tools for heuristics |
Satisfiability/Heuristics/StatisticalAnalysis/plans/milestones.hpp [code] | |
Satisfiability/Heuristics/StatisticalAnalysis/plans/SatisfiabilityPrediction.hpp [code] | Submodule for computing approximated SAT-probabilities |
Satisfiability/Heuristics/StatisticalAnalysis/plans/TimeSeriesAnalysis.hpp [code] | Tools for the analysis of the progress made by a SAT solver |
Satisfiability/Heuristics/StructureRecognition/plans/general.hpp [code] | Module for recognising structures in problem instances |
Satisfiability/Heuristics/StructureRecognition/plans/milestones.hpp [code] | |
Satisfiability/Heuristics/StructureRecognition/plans/RecogniseRandomFormulas.hpp [code] | Tools for the recognition of random formulas |
Satisfiability/Interfaces/DistributedSolving/CollectingDecisions.cpp [code] | Application for collecting decision assignments into one file |
Satisfiability/Interfaces/DistributedSolving/CollectingPartialAssignments.cpp [code] | Application for collecting partial assignments into one file |
Satisfiability/Interfaces/DistributedSolving/PreprocessSplitting.cpp [code] | Application for preparing the list of splitting instances |
Satisfiability/Interfaces/DistributedSolving/plans/general.hpp [code] | Plans regarding distributed solving of SAT problems |
Satisfiability/Interfaces/DistributedSolving/plans/ProcessSplitViaOKsolver.hpp [code] | Plans regarding distributed SAT solving via SplittingViaOKsolver |
Satisfiability/Interfaces/DistributedSolving/plans/RProcessSplitViaOKsolver.hpp [code] | Plans regarding remote-distributed SAT solving via SplittingViaOKsolver |
Satisfiability/Interfaces/InputOutput/AppendDimacs.cpp [code] | Application to select clauses from a clause-set |
Satisfiability/Interfaces/InputOutput/ClauseSetAdaptors.hpp [code] | Adaptors to transfer clause-sets into some data structure |
Satisfiability/Interfaces/InputOutput/Colouring.hpp [code] | Components to transfer colouring problems to CLS-adaptors |
Satisfiability/Interfaces/InputOutput/Dimacs.hpp [code] | Tools for input and output of cnf's in DIMACS format (via CLS-adaptors) |
Satisfiability/Interfaces/InputOutput/Dimacs_Testobjects.hpp [code] | |
Satisfiability/Interfaces/InputOutput/Dimacs_Tests.hpp [code] | Tests for tools concerning DIMACS input and output |
Satisfiability/Interfaces/InputOutput/Exceptions.hpp [code] | Exception classes (and related tools) for input and output of generalised satisfiability problems |
Satisfiability/Interfaces/InputOutput/ExtendedDimacsFullStatistics.cpp [code] | Application to compute statistics for extended Dimacs format |
Satisfiability/Interfaces/InputOutput/ExtendedDimacsStatistics.cpp [code] | Application to compute the basic statistics for extended and strict Dimacs format |
Satisfiability/Interfaces/InputOutput/ExtendedToStrictDimacs.cpp [code] | Application to transfer extended Dimacs format to strict Dimacs format |
Satisfiability/Interfaces/InputOutput/FilterDimacs.cpp [code] | Application to select clauses from a clause-set |
Satisfiability/Interfaces/InputOutput/ManipParam.cpp [code] | Replacing the parameter-line in a DIMACS file by new values |
Satisfiability/Interfaces/InputOutput/MinOnes2PseudoBoolean.cpp [code] | Application to translate a CNF into a pseudo-boolean encoding of the "minimum ones" problem for that CNF |
Satisfiability/Interfaces/InputOutput/MinOnes2WeightedMaxSAT.cpp [code] | Application to translate a CNF into a weighted MaxSAT encoding of the "minimum ones" problem for that CNF |
Satisfiability/Interfaces/InputOutput/PartialAssignments.hpp [code] | Input and output of partial assignments |
Satisfiability/Interfaces/InputOutput/RandomShuffleDimacs.cpp [code] | Application to apply a random permutation to the given clause-list |
Satisfiability/Interfaces/InputOutput/SortByClauseLength.cpp [code] | Application to sort clause-lists by clause length |
Satisfiability/Interfaces/InputOutput/SortByClauseLengthDescending.cpp [code] | Application to sort clause-lists by clause length (descending order) |
Satisfiability/Interfaces/InputOutput/TestInputOutput.cpp [code] | |
Satisfiability/Interfaces/InputOutput/plans/ClauseSetAdaptors.hpp [code] | Plans for adaptors (transferring clause-sets in streams to data structures) |
Satisfiability/Interfaces/InputOutput/plans/Colouring.hpp [code] | Plans regarding translating colouring problems to SAT problems |
Satisfiability/Interfaces/InputOutput/plans/Dimacs.hpp [code] | Plans for the sub-module on input/output in DIMACS format |
Satisfiability/Interfaces/InputOutput/plans/ExtendedDimacsStatistics.hpp [code] | Plans on the application for extracting statistics from files in (extended) Dimacs format |
Satisfiability/Interfaces/InputOutput/plans/ExtendedToStrictDimacs.hpp [code] | Plans regarding the translation from extended forms of Dimacs form to the strict form |
Satisfiability/Interfaces/InputOutput/plans/general.hpp [code] | Plans for the module on SAT-related input/output |
Satisfiability/Interfaces/InputOutput/plans/milestones.hpp [code] | |
Satisfiability/Interfaces/InputOutput/plans/PartialAssignments.hpp [code] | Plans for input and output of partial assignments |
Satisfiability/Interfaces/InputOutput/tests/ClauseSetAdaptors.hpp [code] | Tests for clause-set-adaptors |
Satisfiability/Interfaces/plans/general.hpp [code] | General plans on interfaces for satisfiability |
Satisfiability/Interfaces/plans/milestones.hpp [code] | |
Satisfiability/Optimisation/plans/general.hpp [code] | General plans on optimisation variants of (generalised) satisfiability |
Satisfiability/Optimisation/plans/milestones.hpp [code] | |
Satisfiability/plans/general.hpp [code] | Contains all super-modules regarding (generalised) satisfiability issues |
Satisfiability/plans/milestones.hpp [code] | |
Satisfiability/ProblemInstances/ActiveClauses/concepts/general.hpp [code] | Plans for concepts for active clauses |
Satisfiability/ProblemInstances/ActiveClauses/InjectivityConstraints/AllDifferent.hpp [code] | Algorithms for all-different constraint |
Satisfiability/ProblemInstances/ActiveClauses/InjectivityConstraints/plans/AllDifferent.hpp [code] | Plans for all-different constraint |
Satisfiability/ProblemInstances/ActiveClauses/InjectivityConstraints/plans/general.hpp [code] | Plans for the module on active clauses providing injectivity and bijectivity constraints |
Satisfiability/ProblemInstances/ActiveClauses/InjectivityConstraints/plans/milestones.hpp [code] | |
Satisfiability/ProblemInstances/ActiveClauses/InjectivityConstraints/testobjects/AllDifferent.cpp [code] | Objects for testing of algorithms for alldifferent constraint |
Satisfiability/ProblemInstances/ActiveClauses/InjectivityConstraints/tests/AllDifferent.hpp [code] | Testing of algorithms for alldifferent constraint |
Satisfiability/ProblemInstances/ActiveClauses/plans/general.hpp [code] | General plans on active clauses |
Satisfiability/ProblemInstances/ActiveClauseSets/Equivalences/plans/general.hpp [code] | Plans for the module on equivalence handling |
Satisfiability/ProblemInstances/ActiveClauseSets/Equivalences/plans/milestones.hpp [code] | |
Satisfiability/ProblemInstances/ActiveClauseSets/LinearInequalities/plans/CardinalityConstraints.hpp [code] | Plans for the special linear inequality where all coefficients are 0 or 1 |
Satisfiability/ProblemInstances/ActiveClauseSets/LinearInequalities/plans/general.hpp [code] | Plans for the module providing active clause-sets for linear inequalities |
Satisfiability/ProblemInstances/ActiveClauseSets/LinearInequalities/plans/milestones.hpp [code] | |
Satisfiability/ProblemInstances/ActiveClauseSets/PseudoBoolean/plans/general.hpp [code] | Plans for the module PseudoBoolean |
Satisfiability/ProblemInstances/Clauses/Clause.hpp [code] | Old, very simple implementation of boolean clauses |
Satisfiability/ProblemInstances/Clauses/ClausesWithRemoval.hpp [code] | Clause-classes which allow removal of literals |
Satisfiability/ProblemInstances/Clauses/WatchedLiterals.hpp [code] | Clause-classes supporting watched literals |
Satisfiability/ProblemInstances/Clauses/concepts/general.hpp [code] | Plans for concepts for clauses |
Satisfiability/ProblemInstances/Clauses/concepts/WatchedLiterals.hpp [code] | Plans for concepts for clauses with "watched literals" |
Satisfiability/ProblemInstances/Clauses/plans/general.hpp [code] | General plans on clauses, their concepts and implementations |
Satisfiability/ProblemInstances/Clauses/testobjects/ClausesWithRemoval.cpp [code] | |
Satisfiability/ProblemInstances/Clauses/tests/ClausesWithRemoval.hpp [code] | Generic tests for clause-classes which allow removal of literals |
Satisfiability/ProblemInstances/ClauseSets/ClauseSet.hpp [code] | Old, very simple implementation of boolean clause-sets |
Satisfiability/ProblemInstances/ClauseSets/plans/general.hpp [code] | General plans on clause-sets, their concepts and implementations |
Satisfiability/ProblemInstances/Conditions/AtomicConditions/complement.hpp [code] | Primary template for the complementation function |
Satisfiability/ProblemInstances/Conditions/AtomicConditions/eval.hpp [code] | Primary template for the evaluation function |
Satisfiability/ProblemInstances/Conditions/AtomicConditions/TrivialAtomicConditions.hpp [code] | Typedefs for trivial models of concept AtomicConditions |
Satisfiability/ProblemInstances/Conditions/AtomicConditions/plans/general.hpp [code] | Plans for atomic conditions |
Satisfiability/ProblemInstances/Conditions/AtomicConditions/plans/milestones.hpp [code] | |
Satisfiability/ProblemInstances/Conditions/AtomicConditions/testobjects/TrivialAtomicConditions.cpp [code] | |
Satisfiability/ProblemInstances/Conditions/AtomicConditions/traits/value_type.hpp [code] | Traits-metafunctions to extract the value type |
Satisfiability/ProblemInstances/Conditions/plans/general.hpp [code] | Plans for conditions |
Satisfiability/ProblemInstances/Conditions/plans/milestones.hpp [code] | |
Satisfiability/ProblemInstances/Literals/Basics.hpp [code] | Basic functionality for literals |
Satisfiability/ProblemInstances/Literals/cond.hpp [code] | Primary function template for extracting the (atomic) condition from a literal |
Satisfiability/ProblemInstances/Literals/Literal.hpp [code] | Old, very simple implementation of boolean literals |
Satisfiability/ProblemInstances/Literals/set_cond.hpp [code] | Primary function template to set the (atomic) condition in a literal |
Satisfiability/ProblemInstances/Literals/TrivialLiterals.hpp [code] | Typedefs for models of concept Literals given by signed integral types |
Satisfiability/ProblemInstances/Literals/var.hpp [code] | Primary function template for extracting the variable from a literal |
Satisfiability/ProblemInstances/Literals/concepts/general.hpp [code] | Plans regarding general concepts for literals |
Satisfiability/ProblemInstances/Literals/plans/general.hpp [code] | General plans on literals, their concepts and implementations |
Satisfiability/ProblemInstances/Literals/plans/milestones.hpp [code] | |
Satisfiability/ProblemInstances/Literals/testobjects/Basics.cpp [code] | |
Satisfiability/ProblemInstances/Literals/testobjects/TrivialLiterals.cpp [code] | |
Satisfiability/ProblemInstances/Literals/traits/cond_type.hpp [code] | Traits-metafunctions to extract the condition type |
Satisfiability/ProblemInstances/Literals/traits/var_type.hpp [code] | Traits-metafunctions to extract the variables type |
Satisfiability/ProblemInstances/plans/general.hpp [code] | General plans on problem instances |
Satisfiability/ProblemInstances/plans/milestones.hpp [code] | |
Satisfiability/ProblemInstances/Variables/TestVariables.cpp [code] | |
Satisfiability/ProblemInstances/Variables/TrivialVariables.hpp [code] | Typedefs for models of concept Variables given by signed and unsigned integral types |
Satisfiability/ProblemInstances/Variables/TrivialVariables_Testobjects.hpp [code] | |
Satisfiability/ProblemInstances/Variables/TrivialVariables_Tests.hpp [code] | |
Satisfiability/ProblemInstances/Variables/VarSet.hpp [code] | Old, very simple implementation of variables and sets of variables |
Satisfiability/ProblemInstances/Variables/plans/general.hpp [code] | General plans on variables, their concepts and implementations |
Satisfiability/ProblemInstances/Variables/plans/milestones.hpp [code] | |
Satisfiability/ProblemInstances/Variables/traits/index_type.hpp [code] | Traits-metafunctions to extract the index type |
Satisfiability/ProofSystems/DPv/BasicDataStructure.hpp [code] | Deprecated. Contains simple classes for variables, literals, clauses, clause-sets and literal- and variables-sets |
Satisfiability/ProofSystems/DPv/DPv.cpp [code] | |
Satisfiability/ProofSystems/DPv/DPv.hpp [code] | Deprecated. Contains functions DP-reductions |
Satisfiability/ProofSystems/DPv/Input_output.hpp [code] | Deprecated. Input and output of cnf formulas in DIMACS format |
Satisfiability/ProofSystems/DPv/Input_output_Testobjects.hpp [code] | |
Satisfiability/ProofSystems/DPv/Input_output_Tests.hpp [code] | |
Satisfiability/ProofSystems/DPv/Statistics.hpp [code] | Deprecated. Some functions for basic statistics about clause-sets |
Satisfiability/ProofSystems/DPv/TestDPv.cpp [code] | |
Satisfiability/ProofSystems/DPv/plans/general.hpp [code] | Old module for components around the DP-procedure |
Satisfiability/ProofSystems/plans/general.hpp [code] | General plans on proof systems |
Satisfiability/ProofSystems/plans/milestones.hpp [code] | |
Satisfiability/ProofSystems/Resolution/plans/Certificates.hpp [code] | Plans for resolution certificates (for unsatisfiability) |
Satisfiability/ProofSystems/Resolution/plans/general.hpp [code] | Plans for the modules providing components for resolution handling |
Satisfiability/ProofSystems/Resolution/plans/milestones.hpp [code] | |
Satisfiability/ProofSystems/Resolution/plans/Reductions.hpp [code] | Plans for resolution reductions |
Satisfiability/ProofSystems/Resolution/plans/ResolutionClosure.hpp [code] | Plans for computing all resolvents (resp. all minimal resolvents) |
Satisfiability/ProofSystems/Resolution/plans/Search.hpp [code] | Plans for the sub-module providing components for resolution proof search |
Satisfiability/Quantification/plans/general.hpp [code] | Module for quantified boolean formulas and generalisations |
Satisfiability/Quantification/plans/milestones.hpp [code] | |
Satisfiability/Reductions/Bases/RandomShuffle.cpp [code] | Temporary file, to experiment with std::random_shuffle |
Satisfiability/Reductions/Bases/RUcpBase.cpp [code] | Application for computing a random UCP-base of a clause-set |
Satisfiability/Reductions/Bases/RUcpGen.cpp [code] | Application for computing a Ucp-generating clause-set for a clause-set F and some given stock F0 of clauses to be included |
Satisfiability/Reductions/Bases/docus/general.hpp [code] | User documentation on "r-bases" of clause-sets (and boolean functions) |
Satisfiability/Reductions/Bases/docus/RUcpBase.hpp [code] | Docus file for r_1-base computations at the C++ level |
Satisfiability/Reductions/Bases/plans/general.hpp [code] | Plans regarding the computations of "r-bases" of clause-sets |
Satisfiability/Reductions/Bases/plans/milestones.hpp [code] | |
Satisfiability/Reductions/Bases/plans/UcpBase.hpp [code] | Plans regarding the computation of r_1-bases of clause-sets |
Satisfiability/Reductions/docus/general.hpp [code] | User documentation regarding reductions |
Satisfiability/Reductions/FailedLiteralReduction/plans/general.hpp [code] | Plans for the module FailedLiteralReduction |
Satisfiability/Reductions/FailedLiteralReduction/plans/milestones.hpp [code] | |
Satisfiability/Reductions/KLevelForcedAssignments/GeneralisedUCP.cpp [code] | Application for r_k-reductions on Dimacs input |
Satisfiability/Reductions/KLevelForcedAssignments/GeneralisedUCP.hpp [code] | Components for r_k-reductions |
Satisfiability/Reductions/KLevelForcedAssignments/plans/general.hpp [code] | Plans for the module KLevelForcedAssignments |
Satisfiability/Reductions/KLevelForcedAssignments/plans/GeneralisedUCP.hpp [code] | Plans regarding the components for r_k-reductions |
Satisfiability/Reductions/KLevelForcedAssignments/testobjects/GeneralisedUCP.cpp [code] | |
Satisfiability/Reductions/KLevelForcedAssignments/tests/GeneralisedUCP.hpp [code] | Tests for components for r_k-reductions |
Satisfiability/Reductions/plans/general.hpp [code] | Plans for the development of SAT reductions |
Satisfiability/Reductions/plans/milestones.hpp [code] | |
Satisfiability/Reductions/UnitClausePropagation/ClsAdaptorUCP.hpp [code] | CLS-adaptors which perform unit-clause propagation |
Satisfiability/Reductions/UnitClausePropagation/UnitClausePropagation.cpp [code] | Application for performing UCP on Dimacs input |
Satisfiability/Reductions/UnitClausePropagation/UnitClausePropagationW.cpp [code] | Application for performing UCP on Dimacs input, based on watched literals |
Satisfiability/Reductions/UnitClausePropagation/UnitPropagation.hpp [code] | Experimental code for unit-propagation (boolean clause-sets) |
Satisfiability/Reductions/UnitClausePropagation/plans/ClsAdaptorUCP.hpp [code] | Plans regarding UCP-adaptors |
Satisfiability/Reductions/UnitClausePropagation/plans/general.hpp [code] | Plans for the module on unit-clause propagation |
Satisfiability/Reductions/UnitClausePropagation/plans/UnitClausePropagation.hpp [code] | Plans regarding the specific algorithms used in UnitClausePropagation.cpp / UnitClausePropagationW.cpp |
Satisfiability/Solvers/Argosat/plans/general.hpp [code] | Plans regarding the Argosat solver and library |
Satisfiability/Solvers/Backtracking/DLL-Implementations.cpp [code] | Old, very simple DLL SAT solver (for boolean CNF) |
Satisfiability/Solvers/Backtracking/plans/general.hpp [code] | General plans on generic backtracking solvers |
Satisfiability/Solvers/docus/general.hpp [code] | Central docus-file for SAT solvers |
Satisfiability/Solvers/March/equivalence.c [code] | Updated version to move inline functions to headers |
Satisfiability/Solvers/March/equivalence.h [code] | Updated version to move inline functions to headers |
Satisfiability/Solvers/March/lookahead.c [code] | Updated version to move inline functions to headers |
Satisfiability/Solvers/March/lookahead.h [code] | Updated version to move inline functions to headers |
Satisfiability/Solvers/March/plans/general.hpp [code] | Plans for maintaining solvers from the March family |
Satisfiability/Solvers/Minisat/Minisat+/ADTs/Int.h [code] | Corrected bad inclusion of library-header "gmp.h" |
Satisfiability/Solvers/Minisat/Minisat+/plans/general.hpp [code] | Plans for maintaining Minisat+ |
Satisfiability/Solvers/Minisat/Minisat2/plans/general.hpp [code] | Plans for maintaining Minisat2 |
Satisfiability/Solvers/OKsolver/docus/general.hpp [code] | Central docus-file for the OKsolver-family |
Satisfiability/Solvers/OKsolver/plans/general.hpp [code] | Plans for the development of the OKsolver-family |
Satisfiability/Solvers/OKsolver/plans/milestones.hpp [code] | |
Satisfiability/Solvers/OKsolver/plans/OKsolver_1_0.hpp [code] | Plans for the module simulating the old OKsolver |
Satisfiability/Solvers/OKsolver/plans/OKsolver_2_0.hpp [code] | Plans for the module for the new OKsolver |
Satisfiability/Solvers/OKsolver/plans/OKsolver_3_0.hpp [code] | Plans for the module for the successor of OKsolver_2_0; perhaps for SAT 2013 |
Satisfiability/Solvers/OKsolver/SAT2002/Abstand.h [code] | Header file for distance functions and choice of first branch |
Satisfiability/Solvers/OKsolver/SAT2002/Abstand_aK.c [code] | Distance function weighted number of (all) clauses, choice of branch according to approximation of true probability |
Satisfiability/Solvers/OKsolver/SAT2002/Abstand_DnaZ.c [code] | Distance function Delta(n), choice of branch according to maximal probability for random assignment |
Satisfiability/Solvers/OKsolver/SAT2002/Abstand_nK.c [code] | Standard distance function (weighted number of new clauses), choice of branch according to approximation of true probability |
Satisfiability/Solvers/OKsolver/SAT2002/Abstand_nKaZ.c [code] | Standard distance function (weighted number of new clauses), choice of branch according to maximal probability for random assignment |
Satisfiability/Solvers/OKsolver/SAT2002/Abstand_nKDn.c [code] | As Abstand_nK.c, but the distance mixes in Delta(n) |
Satisfiability/Solvers/OKsolver/SAT2002/anlVar.h [code] | Header file for functions creating the data structures |
Satisfiability/Solvers/OKsolver/SAT2002/Ausgaben.c [code] | Messages, and implementations for functions outputting messages |
Satisfiability/Solvers/OKsolver/SAT2002/Ausgaben.h [code] | Header file for functions outputting messages |
Satisfiability/Solvers/OKsolver/SAT2002/BaumRes.c [code] | Implementations of the functions for tree pruning |
Satisfiability/Solvers/OKsolver/SAT2002/BaumRes.h [code] | The interface for tree pruning |
Satisfiability/Solvers/OKsolver/SAT2002/Belegung.c [code] | Implementations for assignment handling |
Satisfiability/Solvers/OKsolver/SAT2002/Belegung.h [code] | Header file with definitions for assignment handling |
Satisfiability/Solvers/OKsolver/SAT2002/Einlesen.c [code] | Implementations of input/output functions |
Satisfiability/Solvers/OKsolver/SAT2002/Einlesen.h [code] | Header file for input/output functions |
Satisfiability/Solvers/OKsolver/SAT2002/Filter.c [code] | Implementation of the filter |
Satisfiability/Solvers/OKsolver/SAT2002/Filter.h [code] | Header file for the variable-"filtering" function, used for selecting the branching variable |
Satisfiability/Solvers/OKsolver/SAT2002/lokalesLernen.c [code] | First implementation of local learning |
Satisfiability/Solvers/OKsolver/SAT2002/lokalesLernen.h [code] | Interface for local learning |
Satisfiability/Solvers/OKsolver/SAT2002/OK.h [code] | Main header file for the old OKsolver |
Satisfiability/Solvers/OKsolver/SAT2002/OKsolver_2002.c [code] | Complete program of the old OKsolver where everything is included (for better inlining) |
Satisfiability/Solvers/OKsolver/SAT2002/OKsolver_2002_ALLSAT_NTP.c [code] | |
Satisfiability/Solvers/OKsolver/SAT2002/OKsolver_2002_lnk.c [code] | The main compilation unit for the OKsolver_2002 |
Satisfiability/Solvers/OKsolver/SAT2002/OKsolver_2002_NLT.c [code] | |
Satisfiability/Solvers/OKsolver/SAT2002/OKsolver_2002_NLT_osa.c [code] | |
Satisfiability/Solvers/OKsolver/SAT2002/OKsolver_2002_NTP.c [code] | |
Satisfiability/Solvers/OKsolver/SAT2002/OKsolver_2002_NTP_osa.c [code] | |
Satisfiability/Solvers/OKsolver/SAT2002/OKsolver_2002_osa.c [code] | |
Satisfiability/Solvers/OKsolver/SAT2002/OKsolver_2002_OUTPUTXML.c [code] | |
Satisfiability/Solvers/OKsolver/SAT2002/Parameter.c [code] | Definitions of parameters needed for tree pruning |
Satisfiability/Solvers/OKsolver/SAT2002/Parameter.h [code] | Header file for parameters needed for tree pruning |
Satisfiability/Solvers/OKsolver/SAT2002/Projektion.h [code] | The interface for projection functions |
Satisfiability/Solvers/OKsolver/SAT2002/Projektion_Prod.c [code] | The standard projection function, the product |
Satisfiability/Solvers/OKsolver/SAT2002/Reduktion.c [code] | The standard reduction process |
Satisfiability/Solvers/OKsolver/SAT2002/Reduktion.h [code] | The interface for the reduction process |
Satisfiability/Solvers/OKsolver/SAT2002/Speicher.c [code] | Implementations of auxiliary functions regarding memory allocation |
Satisfiability/Solvers/OKsolver/SAT2002/Speicher.h [code] | Header file for auxiliary functions regarding memory allocation |
Satisfiability/Solvers/OKsolver/SAT2002/VarLitKlm.c [code] | Implementations related to variables, literals, and clauses |
Satisfiability/Solvers/OKsolver/SAT2002/VarLitKlm.h [code] | The interface for variables, literals and clause-sets |
Satisfiability/Solvers/OKsolver/SAT2002/docus/general.hpp [code] | General documentation on the original OKsolver |
Satisfiability/Solvers/OKsolver/SAT2002/plans/general.hpp [code] | Plans on the maintenance of the code for the old OKsolver |
Satisfiability/Solvers/OKsolver/SAT2002/plans/milestones.hpp [code] | |
Satisfiability/Solvers/OKsolver/SAT2002/plans/SimpleParallelisation.hpp [code] | Plans on extending OKsolver-2002 for using it to compute a splitting of a large problem into subproblems |
Satisfiability/Solvers/plans/general.hpp [code] | Plans for the development of SAT solvers in the OKlibrary |
Satisfiability/Solvers/plans/milestones.hpp [code] | |
Satisfiability/Solvers/Satz/satz215.2.c [code] | Updated and corrected version |
Satisfiability/Solvers/Satz/docus/general.hpp [code] | General documentation on the Satz solver |
Satisfiability/Solvers/Satz/plans/general.hpp [code] | Plans for maintaining solvers from the Satz family |
Satisfiability/Solvers/Satz/plans/milestones.hpp [code] | |
Satisfiability/Solvers/TawSolver/tawSolver.cpp [code] | |
Satisfiability/Solvers/TawSolver/plans/general.hpp [code] | Plans regarding updating and improving the TawSolver |
Satisfiability/SpecialStructures/HittingClauseSets/plans/ExtendingHittingClauseSets.hpp [code] | Algorithms for extending hitting clause-sets |
Satisfiability/SpecialStructures/HittingClauseSets/plans/general.hpp [code] | General plans for the module on hitting clause-sets |
Satisfiability/SpecialStructures/HittingClauseSets/plans/milestones.hpp [code] | |
Satisfiability/SpecialStructures/MinUnsat/plans/general.hpp [code] | Plans for the module on minimal unsatisfiability |
Satisfiability/SpecialStructures/plans/general.hpp [code] | Plans for the development of components for handling special structures w.r.t. (generalised) SAT |
Satisfiability/SpecialStructures/plans/milestones.hpp [code] | |
Satisfiability/Transformers/CrispCSP/plans/general.hpp [code] | General plans for the module on "crisp CSP" |
Satisfiability/Transformers/CrispCSP/plans/milestones.hpp [code] | |
Satisfiability/Transformers/Generators/FaronsPuzzle.cpp [code] | Application for coding "Enigma 1277" as CNF |
Satisfiability/Transformers/Generators/FaronsPuzzle.hpp [code] | Tools for coding "Enigma 1277" as CNF |
Satisfiability/Transformers/Generators/Filter.cpp [code] | Auxiliary application |
Satisfiability/Transformers/Generators/GreenTaoCNF.cpp [code] | |
Satisfiability/Transformers/Generators/GreenTaoGCNF.cpp [code] | Application for creating SAT instances expressing Green-Tao problems with more than 2 colours |
Satisfiability/Transformers/Generators/Hindman_r2k2.cpp [code] | Components for creating SAT instances Hindman problems with 2 colours and two base numbers |
Satisfiability/Transformers/Generators/LinInequal.cpp [code] | Application for encoding linear inequalities as CNF |
Satisfiability/Transformers/Generators/LinInequal.hpp [code] | Tools for encoding linear inequalities as CNF |
Satisfiability/Transformers/Generators/Musatd2.cpp [code] | Application for creating the saturated minimally unsatisfiable clause-sets of deficiency 2 (in Dimacs format) |
Satisfiability/Transformers/Generators/PdVanderWaerdenCNF.cpp [code] | Application for creating SAT instances expressing 2-coloured palindromised van der Waerden problems |
Satisfiability/Transformers/Generators/Ramsey.cpp [code] | Application for creating 2-colour non-diagonal Ramsey instances (arbitrary hypergraph size) |
Satisfiability/Transformers/Generators/Ramsey.hpp [code] | Fundamental components for creating Ramsey instances |
Satisfiability/Transformers/Generators/Smusat_Horn.cpp [code] | Application for creating the saturated minimally unsatisfiable Horn clause-sets (in Dimacs format) |
Satisfiability/Transformers/Generators/Test_Transformations.cpp [code] | Old test application |
Satisfiability/Transformers/Generators/Tests_Ramsey.hpp [code] | Old tests |
Satisfiability/Transformers/Generators/VanderWaerdenCNF.cpp [code] | Application for creating SAT instances expressing van-der-Waerden problems |
Satisfiability/Transformers/Generators/VanderWaerdenCNF.hpp [code] | Old components for creating SAT instances expressing van-der-Waerden problems |
Satisfiability/Transformers/Generators/plans/AMO.hpp [code] | Plans regarding the AMO-constraint ("at most one") for boolean variables |
Satisfiability/Transformers/Generators/plans/FaronsPuzzle.hpp [code] | Plans for the generator on "Enigma1277" |
Satisfiability/Transformers/Generators/plans/general.hpp [code] | Plans for the module for creating SAT problems from parameters |
Satisfiability/Transformers/Generators/plans/GreenTao.hpp [code] | Plans for generators for Green-Tao problems |
Satisfiability/Transformers/Generators/plans/Hindman.hpp [code] | Plans for generators for Hindman problems |
Satisfiability/Transformers/Generators/plans/LinInequal.hpp [code] | Plans regarding encoding linear inequalities as CNF |
Satisfiability/Transformers/Generators/plans/milestones.hpp [code] | |
Satisfiability/Transformers/Generators/plans/Ramsey.hpp [code] | Plans for generators for Ramsey problems |
Satisfiability/Transformers/Generators/plans/TseitinTransformation.hpp [code] | Plans regarding the Tseitin-transformation |
Satisfiability/Transformers/Generators/plans/VanderWaerden.hpp [code] | Plans for generators for van der Waerden problems |
Satisfiability/Transformers/LadderLogic/plans/general.hpp [code] | General plans for the module on transforming ladder logic in propositional logic |
Satisfiability/Transformers/LadderLogic/plans/milestones.hpp [code] | |
Satisfiability/Transformers/plans/general.hpp [code] | General plans for the general module on transformers (creating SAT problems from other problems) |
Satisfiability/Transformers/plans/milestones.hpp [code] | |
Satisfiability/Transformers/SATModuloTheories/plans/general.hpp [code] | General Plans for SAT "modulo theories" |
Satisfiability/Transformers/SATModuloTheories/plans/milestones.hpp [code] | |
Satisfiability/Values/StatusTypes.hpp [code] | Types related to states |
Satisfiability/Values/plans/general.hpp [code] | General plans on basic value types |
Satisfiability/Values/traits/exceptional_value.hpp [code] | Metafunction for the exceptional value |
Satisfiability/Values/traits/first_value.hpp [code] | Metafunction for the first value |
Satisfiability/Values/traits/last_value.hpp [code] | Metafunction for the last value |
Satisfiability/Variations/plans/general.hpp [code] | Plans for the development of components for variations on (generalised) SAT |
Satisfiability/Variations/plans/milestones.hpp [code] | |
Statistics/docus/general.hpp [code] | Central docus-file for the part providing tools for statistical analysis (in general) |
Statistics/plans/general.hpp [code] | Plans for the module with general statistical tools |
Structures/Cryptology/HashMD5lib.hpp [code] | |
Structures/Cryptology/rijndael.cpp [code] | Implementation of the Rijndael cipher by Szymon Stefanek |
Structures/Cryptology/rijndael.hpp [code] | Implementation of the Rijndael cipher by Szymon Stefanek |
Structures/Cryptology/plans/general.hpp [code] | Plans for the module on cryptological tools |
Structures/Cryptology/plans/MHash.hpp [code] | Plans regarding the usage of the MHash-library |
Structures/Cryptology/plans/milestones.hpp [code] | |
Structures/docus/general.hpp [code] | Central docus-file for the part providing tools for statistical analysis (in general) |
Structures/LinearAlgebra/Matrices/Symmetry.hpp [code] | Testing matrices for (hidden) symmetry |
Structures/LinearAlgebra/Matrices/plans/general.hpp [code] | Plans for the matrices module |
Structures/LinearAlgebra/Matrices/plans/milestones.hpp [code] | |
Structures/LinearAlgebra/Matrices/testobjects/Symmetry.cpp [code] | Testobjects for Matrices/tests/Symmetry.hpp |
Structures/LinearAlgebra/Matrices/tests/Symmetry.hpp [code] | Tests for components from Matrices/Symmetry.hpp |
Structures/NumberTheory/BigIntegers/concepts/plans/general.hpp [code] | Plans for concepts for big integer classes |
Structures/NumberTheory/BigIntegers/concepts/plans/milestones.hpp [code] | |
Structures/NumberTheory/BigIntegers/plans/general.hpp [code] | Plans for the module with big integer tools |
Structures/NumberTheory/BigIntegers/plans/GMPWrapper.hpp [code] | Plans for the sub-module for wrapping the GMP-C-approach into a class according to the basic concept |
Structures/NumberTheory/BigIntegers/plans/milestones.hpp [code] | |
Structures/NumberTheory/PrimeNumbers/GrosswaldHagisFormula.cpp [code] | Computing the coefficients C_k according to [Grosswald, Hagis, 1979] |
Structures/NumberTheory/PrimeNumbers/RankPrimes.cpp [code] | Finding the index of prime numbers |
Structures/NumberTheory/PrimeNumbers/plans/general.hpp [code] | Plans for the module with prime number tools |
Structures/NumberTheory/PrimeNumbers/plans/GrosswaldHagisFormula.hpp [code] | Plans regarding the Grosswald-Hagis-formula for counting arithmetic progressions in primes |
Structures/NumberTheory/PrimeNumbers/plans/RankPrimes.hpp [code] | Plans regarding ranking and unranking of prime numbers |
Structures/plans/general.hpp [code] | General plans for the part on structures (in a mathematical sense) |
Structures/plans/milestones.hpp [code] | |
Structures/Sets/OrdinalNumbers/plans/general.hpp [code] | Plans regarding ordinal numbers in general |
Structures/Sets/plans/general.hpp [code] | Plans regarding set theory and set algorithms in general |
Structures/Sets/SetAlgorithms/BasicMapOperations.hpp [code] | Basic tools for handling maps (in the std-sense as well as in the general sense) |
Structures/Sets/SetAlgorithms/BasicMapOperations_Testobjects.hpp [code] | |
Structures/Sets/SetAlgorithms/BasicMapOperations_Tests.hpp [code] | |
Structures/Sets/SetAlgorithms/BasicSetOperations.hpp [code] | Classes Union<InputIterator_sets, OutputIterator> and Intersection<InputIterator_sets, OutputIterator> for the computation of unions and intersections of sequences of sets |
Structures/Sets/SetAlgorithms/BasicSetOperations_Testobjects.hpp [code] | |
Structures/Sets/SetAlgorithms/BasicSetOperations_Tests.hpp [code] | |
Structures/Sets/SetAlgorithms/SequenceOperations.hpp [code] | Basic operations for sequences |
Structures/Sets/SetAlgorithms/SequenceOperations_Testobjects.hpp [code] | |
Structures/Sets/SetAlgorithms/SequenceOperations_Tests.hpp [code] | Tests for sequence operations |
Structures/Sets/SetAlgorithms/Subsumption.hpp [code] | Module, which mainly provides the class template Subsumption_elimination |
Structures/Sets/SetAlgorithms/Subsumption_Testobjects.hpp [code] | |
Structures/Sets/SetAlgorithms/Subsumption_Tests.hpp [code] | Testing the concept underlying the class template Subsumption_elimination |
Structures/Sets/SetAlgorithms/SubsumptionHypergraph.cpp [code] | Application for computing the subsumption hypergraph of two given set systems |
Structures/Sets/SetAlgorithms/SubsumptionHypergraph.hpp [code] | Module, which implements a subsumption hypergraph generator |
Structures/Sets/SetAlgorithms/TestSetAlgorithms.cpp [code] | |
Structures/Sets/SetAlgorithms/plans/BasicSetOperations.hpp [code] | Plans for basic set operations |
Structures/Sets/SetAlgorithms/plans/general.hpp [code] | Plans for the module on sets-related algorithms and datastructures |
Structures/Sets/SetAlgorithms/plans/milestones.hpp [code] | |
Structures/Sets/SetAlgorithms/plans/Subsumption.hpp [code] | Plans regarding algorithms for subsumption-elimination |
Structures/Sets/SetAlgorithms/plans/SubsumptionHypergraph.hpp [code] | Plans for subsumption hypergraph generator |
Structures/Sets/SetAlgorithms/testobjects/SubsumptionHypergraph.cpp [code] | |
Structures/Sets/SetAlgorithms/tests/SubsumptionHypergraph.hpp [code] | |
System/ComplexitySystem/MeasureCPUSpeed.cpp [code] | Application to measure CPU speed for simple operations |
System/ComplexitySystem/MeasureCPUSpeedMem.cpp [code] | Application to measure CPU speed for simple memory-intensive operations |
System/ComplexitySystem/plans/general.hpp [code] | Plans for the complexity system |
System/ComplexitySystem/plans/milestones.hpp [code] | |
System/docus/general.hpp [code] | Central docus-file for the part containing "systemic" supermodules |
System/LegalIssues/Header.h [code] | |
System/LegalIssues/docus/general.hpp [code] | How to handle licences in files |
System/LegalIssues/plans/general.hpp [code] | General plans regarding licences, copyright etc |
System/LegalIssues/plans/Licence.hpp [code] | Plans regarding licences |
System/LegalIssues/plans/milestones.hpp [code] | |
TestExecutionTools/ExampleRelations.hpp [code] | Examples for binary predicates |
TestExecutionTools/ExampleRelations_Testobjects.hpp [code] | |
TestExecutionTools/ExampleRelations_Tests.hpp [code] | Tests for the examples for binary predicates |
TestExecutionTools/RelationTests.hpp [code] | Tests for relations, like symmetry and transitivity |
TestExecutionTools/RelationTests_Testobjects.hpp [code] | |
TestExecutionTools/RelationTests_Tests.hpp [code] | Tests for the tests on relations regarding properties like symmetry and transitivity |
TestExecutionTools/SecondOrderTestTools.hpp [code] | Tools for testing the test system |
TestExecutionTools/SecondOrderTestTools_Testobjects.hpp [code] | |
TestExecutionTools/SecondOrderTestTools_Tests.hpp [code] | Tests for the tools for testing the test system |
TestExecutionTools/TestAlgorithms.hpp [code] | Algorithms for performing (systematic) tests |
TestExecutionTools/TestAlgorithms_Testobjects.hpp [code] | |
TestExecutionTools/TestAlgorithms_Tests.hpp [code] | Tests for the algorithms for performing (systematic) tests |
TestExecutionTools/TestExecutionTools.cpp [code] | |
TestExecutionTools/plans/milestones.hpp [code] | |
TestExecutionTools/plans/TestExecutionTools.hpp [code] | Plans for the test tools |
TestSystem/BasicDeclarations.hpp [code] | Basic declarations for the test system |
TestSystem/RunTest_Declarations.hpp [code] | Declarations for the class OKlib::TestSystem::RunTest |
TestSystem/RunTest_DesignStudy.hpp [code] | Components for running tests |
TestSystem/TestBaseClass.hpp [code] | Base classes Test and TestBase, from which all test classes are to be derived (Test without auto-insertion, TestBase with) |
TestSystem/TestBaseClass_DesignStudy.hpp [code] | The (user) base class TestSystem::TestBase of the "test-function" hierarchy |
TestSystem/TestExceptions.hpp [code] | Contains the exception classes to be used in test classes to indicate failure, and macros for throwing these exception in standard test situation |
TestSystem/TestExceptions_DesignStudy.hpp [code] | Module providing test macros |
TestSystem/TestFondement.hpp [code] | The abstract base classes for the test system (only for internal purposes) |
TestSystem/TestProgram_DesignStudy.cpp [code] | The one test program, which is linked appropriately with the .o-files for the testobjects |
TestSystem/TestTestSystem.cpp [code] | Test of the (old) test system itself (cannot use the old test system) |
TestSystem/docus/general.hpp [code] | Central docus-file for the higher-order unit test system |
TestSystem/messages/RunTest.hpp [code] | Messages for OKlib::TestSystem::RunTest |
TestSystem/messages/TestBaseClass.hpp [code] | Messages for class OKlib::TestSystem::TestBase |
TestSystem/messages/TestExceptions.hpp [code] | Messages related to test-failure notification |
TestSystem/messages/TestLevel.hpp [code] | Message objects to explain the test levels |
TestSystem/plans/BasicDeclarations.hpp [code] | Plans for the module with basic declarations for the test system |
TestSystem/plans/general.hpp [code] | Plans for the test system (as a whole) |
TestSystem/plans/milestones.hpp [code] | |
TestSystem/plans/RunTest.hpp [code] | Plans for the module for running tests |
TestSystem/plans/RunTest_Declarations.hpp [code] | Plans for the declarations-module for running tests |
TestSystem/plans/TestBaseClass.hpp [code] | Plans for the module with the (user) base of the test hierarchy |
TestSystem/plans/TestExceptions.hpp [code] | Plans for the module providing test macros |
TestSystem/plans/TestFondement.hpp [code] | Plans for the module with the root class of the test hierarchy |
TestSystem/plans/TestProgram.hpp [code] | Plans for the core test program |
TestSystem/testobjects/TestBaseClass.cpp [code] | |
TestSystem/testobjects/Testfunctions.cpp [code] | |
TestSystem/testobjects/Testfunctions2.cpp [code] | |
TestSystem/tests/TestBaseClass.hpp [code] | Tests for the components from TestBaseClass_DesignStudy.hpp |
TestSystem/tests/Testfunctions.hpp [code] | Temporary file for trying out the new test system |
TestSystem/tests/Testfunctions2.hpp [code] | Temporary file with testfunctions to try out the new testsystem |
traits/Testtraits.cpp [code] | |
traits/traits.hpp [code] | Collecting all inclusions for module traits |
traits/TypeTraits.hpp [code] | Extending the (general) type traits from Boost |
traits/TypeTraits_Testobjects.hpp [code] | |
traits/TypeTraits_Tests.hpp [code] | |
traits/TypeTraitsContainer.hpp [code] | Extending the (general) type traits from Boost by container-specific traits |
traits/TypeTraitsContainer_Testobjects.hpp [code] | |
traits/TypeTraitsContainer_Tests.hpp [code] | |
traits/plans/traits.hpp [code] | Plans for the general traits module |
Visualisation/docus/general.hpp [code] | Central docus-file for the visualisation system |
Visualisation/GraphDrawing/plans/general.hpp [code] | Plans for the graph drawing module (as a whole) |
Visualisation/GraphDrawing/plans/milestones.hpp [code] | |
Visualisation/GraphDrawing/plans/Trees.hpp [code] | Plans for drawing trees (especially search trees) |