Search results
- 1.0469668 - MÚ 2017 RIV US eng J - Journal Article
Hrubeš, Pavel
On hardness of multilinearization, and VNP-completeness in characteristics 2.
ACM Transactions on Computation Theory. Roč. 9, č. 1 (2016), č. článku 1. ISSN 1942-3454
EU Projects: European Commission(XE) 339691 - FEALORA
Institutional support: RVO:67985840
Keywords : boolean formula * complexity measure
Subject RIV: BA - General Mathematics
http://dl.acm.org/citation.cfm?doid=3007903.2940323
Permanent Link: http://hdl.handle.net/11104/0267481File Download Size Commentary Version Access Hrubes3.pdf 3 208.9 KB Publisher’s postprint require - 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.0342826 - MÚ 2011 RIV NL eng J - Journal Article
Hrubeš, P. - Jukna, S. - Kulikov, A. - Pudlák, Pavel
On convex complexity measures.
Theoretical Computer Science. Roč. 411, 16-18 (2010), s. 1842-1854. ISSN 0304-3975. E-ISSN 1879-2294
R&D Projects: GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : boolean formula * complexity measure * combinatorial rectangle * convexity
Subject RIV: BA - General Mathematics
Impact factor: 0.838, year: 2010
http://www.sciencedirect.com/science/article/pii/S0304397510000885
Permanent Link: http://hdl.handle.net/11104/0185450File Download Size Commentary Version Access Pudlak.pdf 1 398.4 KB Publisher’s postprint require