Sciweavers

229 search results - page 26 / 46
» Proving Bounds on Real-Valued Functions with Computations
Sort
View
FOCS
2003
IEEE
15 years 3 months ago
A Lattice Problem in Quantum NP
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
Dorit Aharonov, Oded Regev
IPSN
2005
Springer
15 years 3 months ago
Sensing capacity for discrete sensor network applications
We bound the number of sensors required to achieve a desired level of sensing accuracy in a discrete sensor network application (e.g. distributed detection). We model the state of...
Yaron Rachlin, Rohit Negi, Pradeep K. Khosla
CSR
2008
Springer
14 years 12 months ago
From Invariants to Canonization in Parallel
A function f of a graph is called a complete graph invariant if two given graphs G and H are isomorphic exactly when f(G) = f(H). If additionally, f(G) is a graph isomorphic to G, ...
Johannes Köbler, Oleg Verbitsky
BIRTHDAY
2010
Springer
14 years 11 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
FOCS
2009
IEEE
15 years 4 months ago
Smoothed Analysis of Multiobjective Optimization
Abstract— We prove that the number of Pareto-optimal solutions in any multiobjective binary optimization problem with a finite number of linear objective functions is polynomial...
Heiko Röglin, Shang-Hua Teng