Filters
NP search problems in low fragments of bounded arithmetic
NP search problems in low fragments of bounded arithmetic...
BA - Obecná matematika
- 2007 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Consistency of circuit evaluation, extended resolution and total NP search problems
We define a new NP search problem related to circuit evaluation and establish its link to Extended resolution proof system.
BA - Obecná matematika
- 2016 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
A Metaheuristic to Solve a Location Routing Problem with Non-Linear
The paper deals with location-routing problem with nonlivear carts. The problem is NP-Nord, Soheuristic elgorithms are needed to solve the problem. A metaheuristic merging Tabu Search and Variable Neighbor...
BB - Aplikovaná statistika, operační výzkum
- 2005 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
The provably total NP search problems of weak second order bounded arithmetic
We define a new NP search problem, the "local improvement" principle, about labellings of an acyclic, bounded-degree graph. We show that, provably in PV, it characterizes the for all Sigma(b)(1) consequences of V-2(1) and t...
BA - Obecná matematika
- 2011 •
- Jx •
- Link
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Výsledek na webu
Combinatories and triangulations
A problem searching for an optimal triangulation with required properties is solved in this paper. Several new brute-force methods are sescribed. Although they have NP complexity, we try to accelerate the computational time...
JC - Počítačový hardware a software
- 2004 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Combinatories and triangulations
A problem searching for an optimal triangulation with required properties is solved in this paper. Several new brute-force methods are sescribed. Although they have NP complexity, we try to accelerate the computational time...
JC - Počítačový hardware a software
- 2004 •
- D
Rok uplatnění
D - Stať ve sborníku
Approximate counting and NP search problems
We study a new class of NP search problems, those which can be proved total]. In particular, the Ramsey and weak pigeonhole search problems lie in the new class. We give the statements and context of the r...
Pure mathematics
- 2022 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Search for the NN -} 6q phase transition in the np-polarized measurements at Tkin =1-6 GeV.
Search for the NN -} 6q phase transition in the np-polarized measurements at Tkin =1-6 GeV.
BF - Elementární částice a fyzika vysokých energií
- 2008 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
Harmony search algorithm used for solving Travelling salesman problem and its collate with other metaheuristic methods
Travelling salesman problem is very well known and popular optimization problem. It is a NP-hard problem, so the number of possible solutions is very high metaheuristic methods: tabu search, simulated anne...
IN - Informatika
- 2015 •
- D
Rok uplatnění
D - Stať ve sborníku
Native implementation of the robust taboo search for "Quadratic Assignment Problem" for Plan 9 OS
Based on algorithm published by E. Taillard "Robust taboo search for the quadratic assignment problem", Parallel Computing 17, 1991, 443-455. Intended for use in paleoecological ans stratigraphical applications, as many of these can...
JC - Počítačový hardware a software
- 2006 •
- X
Rok uplatnění
X - Nezařazeno
- 1 - 10 out of 115 723