Sciweavers

2316 search results - page 56 / 464
» The many forms of hypercomputation
Sort
View
134
Voted
FM
1999
Springer
114views Formal Methods» more  FM 1999»
15 years 8 months ago
Integrating Formal Description Techniques
Abstract. Using graphical description techniques for formal system development has become a common approach in many tools. Often multiple description techniques are used to represe...
Bernhard Schätz, Franz Huber
DAC
1996
ACM
15 years 8 months ago
Delay Minimal Decomposition of Multiplexers in Technology Mapping
Technology mapping requires the unmapped logic network to be represented in terms of base functions, usually two-input NORs and inverters. Technology decomposition is the step tha...
Shashidhar Thakur, D. F. Wong, Shankar Krishnamoor...
STOC
1993
ACM
121views Algorithms» more  STOC 1993»
15 years 8 months ago
On the generation of multivariate polynomials which are hard to factor
In this paper we consider the di culty of factoring multivariate polynomials F(x y z :::) modulo n. We consider in particular the case in which F is a product of two randomly chose...
Adi Shamir
CHI
2007
ACM
15 years 8 months ago
Making mashups with marmite: towards end-user programming for the web
There is a tremendous amount of web content available today, but it is not always in a form that supports end-users' needs. In many cases, all of the data and services needed...
Jeffrey Wong, Jason I. Hong
ANTS
2010
Springer
262views Algorithms» more  ANTS 2010»
15 years 8 months ago
Short Bases of Lattices over Number Fields
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...
Claus Fieker, Damien Stehlé