Results 1  10
of
3,754,113
On basing oneway functions on NPhardness
 In Proceedings of the ThirtyEighth Annual ACM Symposium on Theory of Computing
, 2006
"... We consider the question of whether it is possible to base the existence of oneway functions on N Phardness. That is we study the the possibility of reductions from a worstcase N Phard decision problem to the task of inverting a polynomial time computable function. We prove two negative results: ..."
Abstract

Cited by 35 (1 self)
 Add to MetaCart
We consider the question of whether it is possible to base the existence of oneway functions on N Phardness. That is we study the the possibility of reductions from a worstcase N Phard decision problem to the task of inverting a polynomial time computable function. We prove two negative results
PseudoRandom Generation from OneWay Functions
 PROC. 20TH STOC
, 1988
"... Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom gene ..."
Abstract

Cited by 887 (22 self)
 Add to MetaCart
Pseudorandom generators are fundamental to many theoretical and applied aspects of computing. We show howto construct a pseudorandom generator from any oneway function. Since it is easy to construct a oneway function from a pseudorandom generator, this result shows that there is a pseudorandom
Universal OneWay Hash Functions and their Cryptographic Applications
, 1989
"... We define a Universal OneWay Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x in the domain, it is computationally hard to find a different domain element which collides with x. We ..."
Abstract

Cited by 357 (15 self)
 Add to MetaCart
We define a Universal OneWay Hash Function family, a new primitive which enables the compression of elements in the function domain. The main property of this primitive is that given an element x in the domain, it is computationally hard to find a different domain element which collides with x. We
The approximability of NPhard problems
 In Proceedings of the Annual ACM Symposium on Theory of Computing
, 1998
"... Many problems in combinatorial optimization are NPhard (see [60]). This has forced researchers to explore techniques for dealing with NPcompleteness. Some have considered algorithms that solve “typical” ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
Many problems in combinatorial optimization are NPhard (see [60]). This has forced researchers to explore techniques for dealing with NPcompleteness. Some have considered algorithms that solve “typical”
GPSGRecognition is NPHard
, 1986
"... Proponents of generalized phrase structure grammar (GPSG) cite its weak contextfree generative power as proof of the computational tractability of GPSGRecognition. Since contextfree languages (CFLs) can be parsed in time proportional to the cube of the sentence length, and GPSGs only generate CFL ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
recognition problem for the GPSGs of Gazdar (1981) is NPhard. Crucially, the time to parse a sentence of a CFL can be the product of sentence length cubed and contextfree grammar size squared, and the GPSG grammar can result in an exponentially large set of derived contextfree rules. A central object
Exact algorithms for NPhard problems: A survey
 Combinatorial Optimization  Eureka, You Shrink!, LNCS
"... Abstract. We discuss fast exponential time solutions for NPcomplete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area. The list of discussed NPcomplete problems includes the travelling salesman problem, schedu ..."
Abstract

Cited by 152 (3 self)
 Add to MetaCart
Abstract. We discuss fast exponential time solutions for NPcomplete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area. The list of discussed NPcomplete problems includes the travelling salesman problem
March Madness is (NP)Hard
"... We formally define the MarchMadness decision problem (inspired by popular betting pools for the NCAA basketball tournament), and prove it NPcomplete. ..."
Abstract
 Add to MetaCart
We formally define the MarchMadness decision problem (inspired by popular betting pools for the NCAA basketball tournament), and prove it NPcomplete.
Graphbased algorithms for Boolean function manipulation
 IEEE TRANSACTIONS ON COMPUTERS
, 1986
"... In this paper we present a new data structure for representing Boolean functions and an associated set of manipulation algorithms. Functions are represented by directed, acyclic graphs in a manner similar to the representations introduced by Lee [1] and Akers [2], but with further restrictions on th ..."
Abstract

Cited by 3499 (47 self)
 Add to MetaCart
on the ordering of decision variables in the graph. Although a function requires, in the worst case, a graph of size exponential in the number of arguments, many of the functions encountered in typical applications have a more reasonable representation. Our algorithms have time complexity proportional
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
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 NPhard
Results 1  10
of
3,754,113