Search results
- 1.0405530 - UIVT-O 330908 US eng V - Research Report
Šíma, Jiří - Schaeffer, S.E.
On the NP-Completeness of Some Graph Cluster Measures.
Cornell University, 2005. 9 s. arXiv.org e-Print archive, cs.CC/0506100.
R&D Projects: GA MŠMT 1M0545
Keywords : graph clustering * conductance * density * cluster editing * NP-completeness
Subject RIV: BA - General Mathematics
http://arxiv.org/pdf/cs.CC/0506100
Permanent Link: http://hdl.handle.net/11104/0125688 - 2.0402598 - UIVT-O 981037 US eng J - Journal Article
Kratochvíl, J. - Savický, Petr - Tuza, Z.
One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete.
Siam Journal on Computing. Roč. 22, č. 1 (1993), s. 203-210. ISSN 0097-5397. E-ISSN 1095-7111
Keywords : satisfiability * Boolean formula * conjuctive normal form * NP-completeness
Permanent Link: http://hdl.handle.net/11104/0122996 - 3.0397466 - ÚTIA 2015 RIV US eng J - Journal Article
Lín, Václav
Decision-theoretic troubleshooting: Hardness of approximation.
International Journal of Approximate Reasoning. Roč. 55, č. 4 (2014), s. 977-988. ISSN 0888-613X. E-ISSN 1873-4731
R&D Projects: GA ČR GA13-20012S
Institutional support: RVO:67985556
Keywords : Decision-theoretic troubleshooting * Hardness of approximation * NP-completeness
Subject RIV: BB - Applied Statistics, Operational Research
Impact factor: 2.451, year: 2014
Permanent Link: http://hdl.handle.net/11104/0225901 - 4.0370919 - ÚI 2012 CZ eng V - Research Report
Rohn, Jiří
An Algorithm for Solving the System -e <= Ax <= e; ||x||_1 => 1.
Prague: ICS AS CR, 2012. 8 s. Technical Report, V-1149.
Institutional research plan: CEZ:AV0Z10300504
Keywords : linear inequalities * absolute value * NP-completeness * algorithm
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0204592File Download Size Commentary Version Access v1149-12.pdf 21 193.8 KB Other open-access - 5.0351120 - MÚ 2011 RIV US eng C - Conference Paper (international conference)
Paturi, R. - Pudlák, Pavel
On the complexity of circuit satisfiability.
STOC'10 : Proceedings of the 2010 ACM International Symposium on Theory of Computing. New York: Association for Computing Machinery, 2010, s. 241-249. ISBN 978-1-60558-817-9.
[Symposium on Theory of Computing : STOC'10. Cambridge (US), 05.06.2010-08.06.2010]
R&D Projects: GA MŠMT(CZ) 1M0545; GA AV ČR IAA100190902
Institutional research plan: CEZ:AV0Z10190503
Keywords : Circuit satisfiability * NP-completeness
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?doid=1806689.1806724
Permanent Link: http://hdl.handle.net/11104/0190940File Download Size Commentary Version Access Pudlak4.pdf 6 167.3 KB Author’s postprint open-access - 6.0339971 - ÚI 2010 RIV DE eng C - Conference Paper (international conference)
Šíma, Jiří - Schaeffer, S.E.
On the NP-Completeness of Some Graph Cluster Measures.
SOFSEM 2006: Theory and Practice of Computer Science. Berlin: Springer, 2006 - (Wiedermann, J.; Tel, G.; Pokorný, J.; Bieliková, M.; Štuller, J.), s. 530-537. Lecture Notes in Computer Science, 3831. ISBN 3-540-31198-X.
[SOFSEM 2006. Conference on Current Trends in Theory and Practice of Computer Science /32./. Měřín (CZ), 21.01.2006-27.01.2006]
R&D Projects: GA MŠMT(CZ) 1M0545
Grant - others:Academy of Finland(FI) 126235
Institutional research plan: CEZ:AV0Z10300504
Keywords : graph clustering * conductance * density * cluster editing * NP-completeness
Subject RIV: BA - General Mathematics
Permanent Link: http://hdl.handle.net/11104/0183326File Download Size Commentary Version Access 0339971.pdf 0 323.7 KB Author´s preprint open-access