Results 1  10
of
491,483
Lattice problems in NP ∩ coNP
 Journal of the ACM
"... We show that the problems of approximating the shortest and closest vector in a lattice to within a factor of √ n lie in NP intersect coNP. The result (almost) subsumes the three mutuallyincomparable previous results regarding these lattice problems: Banaszczyk [7], Goldreich and Goldwasser [14], a ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
We show that the problems of approximating the shortest and closest vector in a lattice to within a factor of √ n lie in NP intersect coNP. The result (almost) subsumes the three mutuallyincomparable previous results regarding these lattice problems: Banaszczyk [7], Goldreich and Goldwasser [14
The Shrinking Property for NP and coNP
 ELECTRONIC COLLOQUIUM ON COMPUTATIONAL COMPLEXITY, REPORT NO. 29
, 2008
"... We study the shrinking and separation properties (two notions wellknown in descriptive set theory) for NP and coNP and show that under reasonable complexitytheoretic assumptions, both properties do not hold for NP and the shrinking property does not hold for coNP. In particular we obtain the follo ..."
Abstract
 Add to MetaCart
the following results. 1. NP and coNP do not have the shrinking property, unless PH is finite. In general, Σ P n and Π P n do not have the shrinking property, unless PH is finite. This solves an open question from [Sel94a]. 2. The separation property does not hold for NP, unless UP ⊆ coNP. 3. The shrinking
Are There Interactive Protocols for CoNP Languages?
 Information Processing Letters
, 1988
"... This paper instead exhibits an oracle such that relative to this oracle there exists a language in coNP that does not have an interactive protocol. From this we get that techniques which relativize will not settle our conjecture. 2 Definitions ..."
Abstract

Cited by 39 (9 self)
 Add to MetaCart
This paper instead exhibits an oracle such that relative to this oracle there exists a language in coNP that does not have an interactive protocol. From this we get that techniques which relativize will not settle our conjecture. 2 Definitions
Text Chunking using TransformationBased Learning
, 1995
"... Eric Brill introduced transformationbased learning and showed that it can do partofspeech tagging with fairly high accuracy. The same method can be applied at a higher level of textual interpretation for locating chunks in the tagged text, including nonrecursive "baseNP" chunks. For ..."
Abstract

Cited by 509 (0 self)
 Add to MetaCart
Eric Brill introduced transformationbased learning and showed that it can do partofspeech tagging with fairly high accuracy. The same method can be applied at a higher level of textual interpretation for locating chunks in the tagged text, including nonrecursive "baseNP" chunks
The English noun phrase in its sentential aspect
, 1987
"... This dissertation is a defense of the hypothesis that the noun phrase is headed by afunctional element (i.e., \nonlexical " category) D, identi ed with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by In (ection), under assump ..."
Abstract

Cited by 509 (4 self)
 Add to MetaCart
This dissertation is a defense of the hypothesis that the noun phrase is headed by afunctional element (i.e., \nonlexical " category) D, identi ed with the determiner. In this way, the structure of the noun phrase parallels that of the sentence, which is headed by In (ection), under
A Threshold of ln n for Approximating Set Cover
 JOURNAL OF THE ACM
, 1998
"... Given a collection F of subsets of S = f1; : : : ; ng, set cover is the problem of selecting as few as possible subsets from F such that their union covers S, and max kcover is the problem of selecting k subsets from F such that their union has maximum cardinality. Both these problems are NPhar ..."
Abstract

Cited by 778 (5 self)
 Add to MetaCart
o(1)) ln n), and previous results of Lund and Yannakakis, that showed hardness of approximation within a ratio of (log 2 n)=2 ' 0:72 lnn. For max kcover we show an approximation threshold of (1 \Gamma 1=e) (up to low order terms), under the assumption that P != NP .
Where the REALLY Hard Problems Are
 IN J. MYLOPOULOS AND R. REITER (EDS.), PROCEEDINGS OF 12TH INTERNATIONAL JOINT CONFERENCE ON AI (IJCAI91),VOLUME 1
, 1991
"... It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard p ..."
Abstract

Cited by 681 (1 self)
 Add to MetaCart
It is well known that for many NPcomplete problems, such as KSat, etc., typical cases are easy to solve; so that computationally hard cases must be rare (assuming P != NP). This paper shows that NPcomplete problems can be summarized by at least one "order parameter", and that the hard
Generating typed dependency parses from phrase structure parses
 IN PROC. INT’L CONF. ON LANGUAGE RESOURCES AND EVALUATION (LREC
, 2006
"... This paper describes a system for extracting typed dependency parses of English sentences from phrase structure parses. In order to capture inherent relations occurring in corpus texts that can be critical in realworld applications, many NP relations are included in the set of grammatical relations ..."
Abstract

Cited by 636 (25 self)
 Add to MetaCart
This paper describes a system for extracting typed dependency parses of English sentences from phrase structure parses. In order to capture inherent relations occurring in corpus texts that can be critical in realworld applications, many NP relations are included in the set of grammatical
A Critical Point For Random Graphs With A Given Degree Sequence
, 2000
"... Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0 the ..."
Abstract

Cited by 511 (8 self)
 Add to MetaCart
Given a sequence of nonnegative real numbers 0 ; 1 ; : : : which sum to 1, we consider random graphs having approximately i n vertices of degree i. Essentially, we show that if P i(i \Gamma 2) i ? 0 then such graphs almost surely have a giant component, while if P i(i \Gamma 2) i ! 0
Data Integration: A Theoretical Perspective
 Symposium on Principles of Database Systems
, 2002
"... Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. The problem of designing data integration systems is important in current real world applications, and is characterized by a number of issues that are interestin ..."
Abstract

Cited by 944 (45 self)
 Add to MetaCart
Data integration is the problem of combining data residing at different sources, and providing the user with a unified view of these data. The problem of designing data integration systems is important in current real world applications, and is characterized by a number of issues
Results 1  10
of
491,483