Výsledky vyhľadávania - "space complexity of refuting unsatisfiable random formulas"

Space complexity of random formulae in resolution

Autori: BEN SASSON E. GALESI, NICOLA

Zdroj: Proceedings 16th Annual IEEE Conference on Computational Complexity. :42-51

Predmety: Complexity of proofs, Complexity of computation (including implicit computational complexity), space complexity of refuting unsatisfiable random formulas, treelike resolution refutations, 0102 computer and information sciences, lower bounds on the clause space, 01 natural sciences, Mechanization of proofs and logical operations, Random Formulas, space proof complexity, Reoslution, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), matching games on bipartite graphs, Graph theory (including graph drawing) in computer science, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Games involving graphs

Popis súboru: application/xml

Prístupová URL adresa: https://zbmath.org/1959946
https://doi.org/10.1002/rsa.10089
https://ieeexplore.ieee.org/document/933871/
https://dblp.uni-trier.de/db/conf/coco/coco2001.html#Ben-SassonG01
http://ieeexplore.ieee.org/document/933871/
https://hdl.handle.net/11573/133656
http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000184211400005&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a
https://doi.org/10.1002/rsa.10089