PolyRocketMatt

$ make graal-jdk-17-plus BACKEND=ptx
./bin/compile.sh graal-jdk-17-plus ptx
mvn -Popencl-backend,ptx-backend,spirv-backend clean
[INFO] Scanning for projects...
[INFO] ------------------------------------------------------------------------
[INFO] Reactor Build Order:
[INFO]
[INFO] tornado                                                            [pom]
[INFO] tornado-api                                                        [jar]
[INFO] tornado-runtime                                                    [jar]

PolyRocketMatt

/**
 *  Copyright (c) <2022> <Yann Thorimbert, Bastien Chopard, Matthias Kovacic>
 * Permission is hereby granted, free of charge, to any person
 * obtaining a copy of this software and associated documentation
 * files (the "Software"), to deal in the Software without
 * restriction, including without limitation the rights to use,
 * copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following
 * conditions:

PolyRocketMatt

/*
 * MIT License
 *
 * Copyright (c) 2022 Marvin (DerFrZocker)
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is

PolyRocketMatt

complexiteit klassen P, NP, NPC

P

formeel

alle ja/nee problemen die opgelost kunnen worden met een deterministische Turingmachine binnen polynomiale tijd.

Begrijpelijk gezegd

alle ja/nee problemen die kunnen opgelost worden met een uitvoeringstijd die een veelterm is afhankelijk van de invoerlengte.

Voorbeeld