Which problems have strongly exponential complexity? (Q1604206): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q55891730, #quickstatements; #temporary_batch_1714639695901 |
Created claim: DBLP publication ID (P1635): journals/jcss/ImpagliazzoPZ01, #quickstatements; #temporary_batch_1736172698238 |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1006/jcss.2001.1774 / rank | |||
Property / cites work | |||
Property / cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4004078 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4230322 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4252729 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4385519 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3619797 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Worst-case time bounds for coloring and satisfiability problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4250220 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving satisfiability in less than \(2^ n\) steps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4484662 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved exponential-time algorithm for <i>k</i> -SAT / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4526973 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Optimization, approximation, and complexity classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the density of families of sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4283247 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Power indices and easier hard problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4252414 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4164821 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4004139 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Finding a Maximum Independent Set / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for maximum independent sets / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1006/JCSS.2001.1774 / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/jcss/ImpagliazzoPZ01 / rank | |||
Normal rank |
Latest revision as of 16:12, 6 January 2025
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Which problems have strongly exponential complexity? |
scientific article |
Statements
Which problems have strongly exponential complexity? (English)
0 references
4 July 2002
0 references
sub-exponential reduction family
0 references
NP-complete problems
0 references
0 references