All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Polynomial Algorithm for Solving Cross-matching Puzzles

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F21%3A50018471" target="_blank" >RIV/62690094:18450/21:50018471 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007/978-3-030-87897-9_24" target="_blank" >https://link.springer.com/chapter/10.1007/978-3-030-87897-9_24</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-030-87897-9_24" target="_blank" >10.1007/978-3-030-87897-9_24</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Polynomial Algorithm for Solving Cross-matching Puzzles

  • Original language description

    The aim of this paper it to analyze the cross-matching puzzle and to propose a fast and deterministic algorithm that can solve it. Nevertheless, there is a bigger goal than designing an algorithm for a particular problem. We want to show that while AI researchers constantly look for new constraint-satisfaction problems that could be utilized for testing various problem-solving techniques it is possible to come up with the problem that can be solved by much simpler algorithms. We would like to stress that there is an important misconception related to NP class that a huge number of potential solutions to the specific problem almost automatically implies that the relevant problem belongs to the class of NP. Such a misunderstanding and misclassification of the particular problem leads to false impression that there is no chance to design a simple and fast algorithm for the problem. Therefore, various heuristics or general problem-solving techniques are unnecessarily employed in order to solve it. And moreover, the wrong impression that the problem is difficult is further supported. We believe that our paper can help to raise the awareness that not all the problems with immense search spaces are hard to be solved and the polynomial algorithm to tackle the cross-matching puzzle that is described here is a good example of such an approach.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2021

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Artificial Intelligence and Soft Computing. Lecture Notes in Computer Science, vol 12855.

  • ISBN

    978-3-030-87896-2

  • ISSN

    0302-9743

  • e-ISSN

    1611-3349

  • Number of pages

    10

  • Pages from-to

    257-266

  • Publisher name

    Springer

  • Place of publication

    Cham

  • Event location

    Zakopane, Poland

  • Event date

    Jun 21, 2021

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article