Vyzkoušejte nový nástroj s podporou AI
Summon Research Assistant
BETA
Application of incremental satisfiability problem solvers for non-deterministic polynomial-time hard problems as illustrated by minimal Boolean formula synthesis problem
Chukharev, K.I.
Published in Nauchno-tekhnicheskiĭ vestnik informat͡s︡ionnykh tekhnologiĭ, mekhaniki i optiki (01.11.2020)
Published in Nauchno-tekhnicheskiĭ vestnik informat͡s︡ionnykh tekhnologiĭ, mekhaniki i optiki (01.11.2020)
Get full text
Journal Article