Výsledky vyhledávání - "Polynomial-time recognition algorithm"

Indirect identification of horizontal gene transfer

Autoři: Schaller, David Lafond, Manuel Stadler, Peter F. a další

Zdroj: Journal of Mathematical Biology. 83(1)

Témata: Gene families, Xenology, Binary relation, Indirect phylogenetic methods, Horizontal gene transfer, Fitch graph, Later-divergence-time, Polynomial-time recognition algorithm

Popis souboru: print

Přístupová URL adresa: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-196069
https://doi.org/10.1007/s00285-021-01631-0

A general approach to avoiding two by two submatrices

Autoři: Vladimir G. Deineko Gerhard J. Woeginger Rüdiger Rudolf

Zdroj: Computing. 52:371-388

Témata: Supnick matrices, Permutations, words, matrices, Analysis of algorithms and problem complexity, Monge matrices, 0211 other engineering and technologies, Combinatorics in computer science, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, matrix, decision problem, polynomial time recognition algorithm, Combinatorial aspects of matrices (incidence, Hadamard, etc.), NP-complete

Popis souboru: application/xml

Přístupová URL adresa: https://link.springer.com/article/10.1007/BF02276883
https://www.narcis.nl/publication/RecordID/oai%3Apure.tue.nl%3Apublications%2Ff9e1d4c7-9189-4e0e-be5a-22989d69a7a9
https://research.tue.nl/nl/publications/a-general-approach-to-avoiding-two-by-two-submatrices
https://dblp.uni-trier.de/db/journals/computing/computing52.html#DeinekoRW94

Two systems for proving tautologies, based on the split method

Autoři: E. Ya. Dantsin

Zdroj: Journal of Soviet Mathematics. 22:1293-1305

Témata: Complexity of proofs, Classical propositional logic, Complexity of computation (including implicit computational complexity), classes with polynomial time recognition algorithm, 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, propositional tautologies, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3803401
https://doi.org/10.1007/bf01084392
https://link.springer.com/article/10.1007/BF01084392

On the Complexity of Covering Vertices by Faces in a Planar Graph: On the complexity of covering vertices by faces in a planar graph

Autoři: Daniel Bienstock Clyde L. Monma

Zdroj: SIAM Journal on Computing. 17:53-76

Témata: embedding, Graph theory (including graph drawing) in computer science, Analysis of algorithms and problem complexity, planar graph, polynomial-time recognition algorithm, 0102 computer and information sciences, complexity, 01 natural sciences, Steiner tree, Planar graphs, geometric and topological aspects of graph theory

Popis souboru: application/xml

Přístupová URL adresa: http://www.monma.com/clyde/docs/OTCO
1988.pdf

Two systems of proof of tautology based on the splitting method

Autoři: Dantsin, E. Ya.

Témata: Complexity of proofs, Classical propositional logic, Complexity of computation (including implicit computational complexity), classes with polynomial time recognition algorithm, propositional tautologies

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/3747068