Approximate Halfspace Range Counting
- 期刊名称SIAM Journal on Computing
- 作者Aronov, Boris; Sharir, Micha
- 卷第39卷
- 期第7期
- 印刷ISSN0097-5397
- 电子ISSN1095-7111
- 文件大小313.16KB
- 发表时间2010-01
- DOI10.1137/080736600
- 页码2704-2725
Dobrushin Conditions and Systematic ScanDYER, MARTIN; GOLDBERG, LESLIE ANN; JERRUM, MARK · Combinatorics, Probability and Computing · 2008
Systematic Scan for Sampling ColoringsMartin Dyer, Leslie Ann Goldberg and Mark Jerrum · The Annals of Applied Probability · 2006
Systematic scan for sampling coloringsDyer, Martin; Goldberg, Leslie Ann; Jerrum, Mark · The Annals of Applied Probability · 2006
An approximation trichotomy for Boolean #CSPMartin Dyer; Leslie Ann Goldberg; Mark Jerrum · 2010
Counting and sampling H-colouringsMartin Dyer; Leslie Ann Goldberg; Mark Jerrum · 2004
A Complexity Dichotomy For Hypergraph Partition FunctionsMartin Dyer; Leslie Ann Goldberg; Mark Jerrum · 2010
The Relative Complexity of Approximate Counting ProblemsMartin Dyer; Leslie Ann Goldberg; Catherine Greenhill; Mark Jerrum · Algorithmica · 2004
On Three-Dimensional PackingLi, Keqin; Cheng, Kam-Hoi · SIAM Journal on Computing · 1990
Priority Search TreesMcCreight, Edward M. · SIAM Journal on Computing · 1985
Scheduling Split IntervalsBar-Yehuda, R.; Halldórsson, M. M.; Naor, J. (S.); Shachnai, H.; Shapira, I. · SIAM Journal on Computing · 2006
Nondeterminism within $P^ * $Buss, Jonathan F.; Goldsmith, Judy · SIAM Journal on Computing · 1993
Optimization of Straight Line ProgramsAho, Alfred V.; Ullman, Jeffrey D. · SIAM Journal on Computing · 1972
Quantum Entanglement and Communication ComplexityBuhrman, Harry; Cleve, Richard; van Dam, Wim · SIAM Journal on Computing · 2001
On Classes of Program SchemataConstable, Robert L.; David, Gries · SIAM Journal on Computing · 1972
Bounded Concurrent Time-StampingDolev, Danny; Shavit, Nir · SIAM Journal on Computing · 1997