Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
2957
search results - page 117 / 592
»
The Complexity of Polynomial-Time Approximation
Sort
relevance
views
votes
recent
update
View
thumb
title
24
click to vote
APPROX
2000
Springer
84
views
Algorithms
»
more
APPROX 2000
»
On the relative complexity of approximate counting problems
14 years 2 months ago
Download
web.maths.unsw.edu.au
Martin E. Dyer, Leslie Ann Goldberg, Catherine S. ...
claim paper
Read More »
22
click to vote
COCOON
1999
Springer
109
views
Combinatorics
»
more
COCOON 1999
»
On the Complexity of Approximating Colored-Graph Problems
14 years 2 months ago
Download
www.mat.uniroma2.it
Andrea E. F. Clementi, Pierluigi Crescenzi, Gianlu...
claim paper
Read More »
31
click to vote
FOCS
1998
IEEE
118
views
Theoretical Computer Science
»
more
FOCS 1998
»
The Complexity of the Approximation of the Bandwidth Problem
14 years 2 months ago
Download
www.cs.ust.hk
d Abstract) Walter Unger Lehrstuhl f
Walter Unger
claim paper
Read More »
31
click to vote
DCC
1993
IEEE
102
views
Computer Graphics
»
more
DCC 1993
»
Minimizing Error and VLSI Complexity in the Multiplication-Free Approximation of Arithmetic Coding
14 years 2 months ago
Download
www.eecg.toronto.edu
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
Gennady Feygin, P. Glenn Gulak, Paul Chow
claim paper
Read More »
30
click to vote
COMPGEOM
2006
ACM
123
views
Discrete Geometry
»
more
COMPGEOM 2006
»
The effect of corners on the complexity of approximate range searching
14 years 1 months ago
Download
www.cs.umd.edu
Sunil Arya, Theocharis Malamatos, David M. Mount
claim paper
Read More »
« Prev
« First
page 117 / 592
Last »
Next »