咨询与建议

限定检索结果

文献类型

  • 11 篇 期刊文献
  • 5 篇 会议

馆藏范围

  • 16 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 12 篇 工学
    • 12 篇 计算机科学与技术...
    • 1 篇 软件工程
  • 7 篇 理学
    • 7 篇 数学

主题

  • 16 篇 exponential algo...
  • 5 篇 approximation al...
  • 5 篇 randomized algor...
  • 4 篇 boolean satisfia...
  • 2 篇 exact algorithms
  • 2 篇 approximate coun...
  • 1 篇 traveling salesm...
  • 1 篇 combinatorics
  • 1 篇 graph algorithms
  • 1 篇 hardness of appr...
  • 1 篇 pattern matching
  • 1 篇 independent sets
  • 1 篇 distortion
  • 1 篇 bandwidth
  • 1 篇 min coloring pro...
  • 1 篇 dominating set
  • 1 篇 algebraic comple...
  • 1 篇 sub-exponential ...
  • 1 篇 min set cover
  • 1 篇 fixed-parameter ...

机构

  • 3 篇 univ paris 09 f-...
  • 1 篇 univ essex sch c...
  • 1 篇 tsinghua univers...
  • 1 篇 polish acad sci ...
  • 1 篇 lamsade cnrs umr...
  • 1 篇 shanghai jiao to...
  • 1 篇 politecn torino ...
  • 1 篇 inst univ france
  • 1 篇 univ bristol dep...
  • 1 篇 univ torino dipa...
  • 1 篇 tu chemnitz chem...
  • 1 篇 tsinghua univ in...
  • 1 篇 vienna univ tech...
  • 1 篇 vienna univ tech...
  • 1 篇 shanghai jiaoton...
  • 1 篇 univ oxford dept...
  • 1 篇 univ paris 09 ps...
  • 1 篇 shanghai jiao to...
  • 1 篇 univ paris panth...
  • 1 篇 middlesex univ d...

作者

  • 4 篇 scheder dominik
  • 3 篇 paschos vangelis...
  • 2 篇 pilipczuk marcin
  • 2 篇 paschos v. th.
  • 2 篇 escoffier bruno
  • 2 篇 escoffier b.
  • 2 篇 bourgeois n.
  • 2 篇 cygan marek
  • 2 篇 bourgeois nicola...
  • 1 篇 steinberger john
  • 1 篇 john p. steinber...
  • 1 篇 goldberg leslie ...
  • 1 篇 lackner martin
  • 1 篇 pratt kevin
  • 1 篇 wojtaszczyk jaku...
  • 1 篇 dominik scheder
  • 1 篇 thurley marc
  • 1 篇 bruner marie-lou...
  • 1 篇 steinberger john...
  • 1 篇 boria nicolas

语言

  • 13 篇 英文
  • 3 篇 其他
检索条件"主题词=Exponential algorithms"
16 条 记 录,以下是11-20 订阅
排序:
A Stronger Connection between the Asymptotic Rank Conjecture and the Set Cover Conjecture  2024
A Stronger Connection between the Asymptotic Rank Conjecture...
收藏 引用
56th Annual ACM Symposium on Theory of Computing (STOC)
作者: Pratt, Kevin NYU Courant Inst Math Sci New York NY 10012 USA
We give a short proof that Strassen's asymptotic rank conjecture implies that for every epsilon > 0 there exists a (3/2(2/3) + epsilon)(n) -time algorithm for set cover on a universe of size n with sets of boun... 详细信息
来源: 评论
An Approximation Algorithm for #k-SAT
An Approximation Algorithm for #<i>k</i>-SAT
收藏 引用
29th International Symposium on Theoretical Aspects of Computer Science (STACS)
作者: Thurley, Marc Ctr Recerca Matemat Bellaterra Spain
We present a simple randomized algorithm that approximates the number of satisfying assignments of Boolean formulas in conjunctive normal form. To the best of our knowledge this is the first algorithm which approximat... 详细信息
来源: 评论
PPSZ for General k-SAT - Making Hertli's Analysis Simpler and 3-SAT Faster  32
PPSZ for General <i>k</i>-SAT - Making Hertli's Analysis Sim...
收藏 引用
32nd Computational Complexity Conference (CCC)
作者: Scheder, Dominik Steinberger, John P. Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai Peoples R China Tsinghua Univ Inst Interdisciplinary Informat Sci Beijing Peoples R China
The currently fastest known algorithm for k-SAT is PPSZ named after its inventors Paturi, Pudlak, Saks, and Zane [7]. Analyzing its running time is much easier for input formulas with a unique satisfying assignment. I... 详细信息
来源: 评论
PPSZ is better than you think  62
PPSZ is better than you think
收藏 引用
62nd IEEE Annual Symposium on Foundations of Computer Science (FOCS)
作者: Scheder, Dominik Shanghai Jiao Tong Univ Dept Comp Sci Shanghai Peoples R China
PPSZ, for long time the fastest known algorithm for k-SAT, works by going through the variables of the input formula in random order;each variable is then set randomly to 0 or 1, unless the correct value can be inferr... 详细信息
来源: 评论
PPSZ for k ≥ 5: More Is Better
收藏 引用
ACM TRANSACTIONS ON COMPUTATION THEORY 2019年 第4期11卷 25-25页
作者: Scheder, Dominik Shanghai Jiao Tong Univ 800 Dongchuan Rd Shanghai 200240 Peoples R China
We show that for k >= 5, the PPSZ algorithm for k-SAT runs exponentially faster if there is an exponential number of satisfying assignments. More precisely, we show that for every k >= 5, there is a strictly inc... 详细信息
来源: 评论
PPSZ for general k-SAT: making Hertli's analysis simpler and 3-SAT faster  17
PPSZ for general k-SAT: making Hertli's analysis simpler and...
收藏 引用
Proceedings of the 32nd Computational Complexity Conference
作者: Dominik Scheder John P. Steinberger Shanghai Jiaotong University Shanghai China Tsinghua University Beijing China
In this paper, we achieve three goals. First, we simplify Hertli's 2011 analysis [1] for input formulas with multiple satisfying assignments. Second, we show a "translation result": if you improve PPSZ f... 详细信息
来源: 评论