Q5743451 (Q5743451): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 05:11, 19 July 2024

scientific article; zbMATH DE number 7053329

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7053329

Statements

scholarly article

0 references

Russell Impagliazzo

0 references

William Matthews

0 references

Ramamohan Paturi

0 references

publication date

10 May 2019

0 references

full work available at URL

https://arxiv.org/abs/1107.3127

0 references

https://dl.acm.org/citation.cfm?id=2095193

0 references

MaRDI profile type

MaRDI publication profile

0 references

The Complexity of Satisfiability of Small Depth Circuits

0 references

Top-down lower bounds for depth-three circuits

0 references

3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General

0 references

0 references

Solving satisfiability in less than \(2^ n\) steps

0 references

A full derandomization of schöning's k-SAT algorithm

0 references

An improved exponential-time algorithm for <i>k</i> -SAT

0 references

0 references

0 references

An algorithm for the satisfiability problem of formulas in conjunctive normal form

0 references

Improving exhaustive search implies superpolynomial lower bounds

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5743451

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5743451&oldid=36492106"