نتایج جستجو برای: adelman lipton model
تعداد نتایج: 2104804 فیلتر نتایج به سال:
Ladyman, Lipton, and Teller on The Empirical Stance Bas C. van Fraassen I. What is a stance? 1. The argument 2 What is a stance, in general? A. "Stance" and non-philosophical stances B. Role and unity of a stance 3. What is a philosophical stance? 4. What is an empiricist stance? II. Metaphysics III. Voluntarism A. Ladyman's challenge: counterinductive strategies B. The challenge concerning tol...
The Orbit problem is defined as follows: Given a matrix A ∈ Q and vectors x,y ∈ Q, does there exist a non-negative integer i such that Ax = y. This problem was shown to be in deterministic polynomial time by Kannan and Lipton in [8]. In this paper we place the problem in the logspace counting hierarchy GapLH. We also show that the problem is hard for L under NC-many-one reductions.
If Alice has x, y, Bob has x, z and Carol has y, z can they determine if x+ y+ z = N? They can if (say) Alice broadcasts x to Bob and Carol; can they do better? Chandra, Furst, and Lipton studied this problem and showed sublinear upper bounds. They also had matching (up to an additive constant) lower bounds. We give an exposition of their result with some attention to what happens for particula...
This paper investigates the connexion between the Kannan-Lipton Orbit Problem and the polynomial invariant generator algorithm PILA based on eigenvectors computation. Namely, we reduce the problem of generating linear and polynomial certificates of non-reachability for the Orbit Problem for linear transformations with coefficients in Q to the generalized eigenvector problem. Also, we prove the ...
Name Department Sumanta Acharya Mechanical Engineering Gerald Baumgartner Computer Science Bin Chen Chemistry Jim Chen Civil Engineering Rudy Hirschheim Information Systems and Decision Sciences Bijaya Karki Computer Science David Koppelman Electrical & Computer Engineering Tevfik Kosar Computer Science Robert Lipton Mathematics Marcia Newcomer Biological Sciences Seung-Jong Park Computer Scien...
Received for publication 1 Dec. 1999. Accepted for publication 13 June 2000. We thank Lipton Foods, Campbell Soup Co., and Heinz USA for inclusion of these lines in their trials. The cost of publishing this paper was defrayed in part by the payment of page charges. Under postal regulations, this paper therefore must be hereby marked advertisement solely to indicate this fact. E-mail address: st...
An anticoloring of a graph is a coloring of some of the vertices, such that no two adjacent vertices are colored in distinct colors. We deal with the anticoloring problem with two colors for planar graphs, and, using Lipton and Tarjan’s separation algorithm, provide an algorithm with some bound on the error. In the particular cases of graphs which are strong products of two paths or two cycles,...
This is a survey about the title question, written for people who (like the author) see logic as forbidding, esoteric, and remote from their usual concerns. Beginning with a crash course on Zermelo-Fraenkel set theory, it discusses oracle independence; natural proofs; independence results of Razborov, Raz, DeMillo-Lipton, Sazanov, and others; and obstacles to proving P vs. NP independent of str...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید