Results 1  10
of
266
Properties of NPcomplete sets
 In Proceedings of the 19th IEEE Conference on Computational Complexity
, 2004
"... We study several properties of sets that are complete for NP. We prove that if L is an NPcomplete set and S � ⊇ L is a pselective sparse set, then L − S is ≤p mhard for NP. We demonstrate existence of a sparse set S ∈ DTIME(22n) such that for every L ∈ NP − P, L − S is not ≤p mhard for NP. Moreo ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
We study several properties of sets that are complete for NP. We prove that if L is an NPcomplete set and S � ⊇ L is a pselective sparse set, then L − S is ≤p mhard for NP. We demonstrate existence of a sparse set S ∈ DTIME(22n) such that for every L ∈ NP − P, L − S is not ≤p mhard for NP
Selfdetermination and persistence in a reallife setting: Toward a motivational model of high school dropout.
 Journal of Personality and Social Psychology,
, 1997
"... The purpose of this study was to propose and test a motivational model of high school dropout. The model posits that teachers, parents, and the school administration's behaviors toward students influence students' perceptions of competence and autonomy. The less autonomy supportive the so ..."
Abstract

Cited by 183 (19 self)
 Add to MetaCart
covariance matrix of the observed variables (which also include the means) is shown in the Appendix. The model was statistically tested using L1SREL VII Structural and measurement coefficients from the completely standardized solution under maximum likelihood are displayed in The less autonomy supportive
Strong Equivalence of Logic Programs under the InfiniteValued Semantics
"... We consider the notion of strong equivalence [4] of normal propositional logic programs under the infinitevalued semantics [7] (which is a purely modeltheoretic semantics that is compatible with the wellfounded one). We demonstrate that two such programs are strongly equivalent under the infinite ..."
Abstract
 Add to MetaCart
We consider the notion of strong equivalence [4] of normal propositional logic programs under the infinitevalued semantics [7] (which is a purely modeltheoretic semantics that is compatible with the wellfounded one). We demonstrate that two such programs are strongly equivalent under
W hardness under linear FPTreductions: structural properties and further applications
 in Proceedings of the The Eleventh International Computing and Combinatorics Conference (COCOON’05
, 2005
"... Abstract. The notion of linear fptreductions has been recently used to derive strong computational lower bounds for wellknown NPhard problems. In this paper, we formally investigate the notions of W [t]hardness and W [t]completeness under the linear fptreduction, and study structural propertie ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract. The notion of linear fptreductions has been recently used to derive strong computational lower bounds for wellknown NPhard problems. In this paper, we formally investigate the notions of W [t]hardness and W [t]completeness under the linear fptreduction, and study structural
Interactive Proofs under Continual Memory Leakage
"... We consider the task of constructing interactive proofs for NP which can provide meaningful security for a prover even in the presence of continual memory leakage. We imagine a setting where an adversarial verifier participates in multiple sequential interactive proof executions for a fixed NP state ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
executions, in fact the entire prover witness might end up getting leaked thus leading to a complete compromise of prover security. Towards that end, we define the notion of nontransferable proofs for all languages in NP. In such proofs, instead of receiving w as input, the prover will receive an “encoding
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
 In Proc. ASP03. Available at: http://CEURWS.org/Vol78
, 2003
"... In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can be expressed. However, from a semantical point of view, disjunction is often not really needed, in that an equivalent program wit ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
; testing this criterion is coNPcomplete. We also show that under ordinary and uniform equivalence, this elimination is always possible. In all cases, there are constructive methods to achieve this. Our results extend and complement recent results on simplifying logic programs under different notions
AverageCase Complexity Theory and PolynomialTime Reductions
, 2001
"... This thesis studies averagecase complexity theory and polynomialtime reducibilities. The issues in averagecase complexity arise primarily from Cai and Selman's extension of Levin's denition of average polynomial time. We study polynomialtime reductions between distributional problems. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
. Under strong but reasonable hypotheses we separate ordinary NPcompleteness notions.
On Eliminating Disjunctions in Stable Logic Programming
 PROCEEDINGS OF THE 9TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING (KR 2004
, 2003
"... Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge representation and reasoning. However, disjunction is often not really needed, in that an equivalent program without disju ..."
Abstract

Cited by 13 (9 self)
 Add to MetaCart
disjunctions can be eliminated under strong equivalence; testing this criterion is coNPcomplete, but the class of programs satisfying it has the same complexity as disjunctive logic programs in general. We also show that under ordinary and uniform equivalence, disjunctions can always be eliminated. In all
Ontology and Information Systems
"... Abstract. The term 'formal ontology' was first used by the philosopher Edmund Husserl in his Logical investigations to signify the study of those formal structures and relations above all relations of part and whole which are exemplified in the subjectmatters of the different material ..."
Abstract

Cited by 18 (1 self)
 Add to MetaCart
of the categorial distinction mentioned under 2. above). Our sugg~stio~, then, is that mereotopology, the combination of mereology and topology, will yield a more adequate framework, allowing f01malontological hypotheses to be foimulated in a more direct and straightforward fashion, than is the case if formal
Results 1  10
of
266