Sciweavers

971 search results - page 55 / 195
» Approximate Satisfiability and Equivalence
Sort
View
TIT
2008
107views more  TIT 2008»
13 years 9 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak
DM
2002
82views more  DM 2002»
13 years 9 months ago
Hilbert functions of ladder determinantal varieties
We outline the computation of an explicit formula for the Hilbert function of the ladder determinantal varieties defined by the vanishing of all minors of a fixed size of a rectang...
Sudhir R. Ghorpade
JFP
2002
89views more  JFP 2002»
13 years 9 months ago
The countdown problem
We systematically develop a functional program that solves the countdown problem, a numbers game in which the aim is to construct arithmetic expressions satisfying certain constra...
Graham Hutton
TIT
2002
68views more  TIT 2002»
13 years 9 months ago
A Lagrangian formulation of Zador's entropy-constrained quantization theorem
Abstract--Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd...
Robert M. Gray, Tamás Linder, Jia Li
AAAI
2012
12 years 10 days ago
Optimal Proportional Cake Cutting with Connected Pieces
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
Xiaohui Bei, Ning Chen, Xia Hua, Biaoshuai Tao, En...