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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
16666
search results - page 259 / 3334
»
Descriptive and Computational Complexity
Sort
relevance
views
votes
recent
update
View
thumb
title
108
click to vote
MFCS
2005
Springer
74
views
Theoretical Computer Science
»
more
MFCS 2005
»
Complexity Bounds for Regular Games
16 years 21 days ago
Download
www.cl.cam.ac.uk
Paul Hunter, Anuj Dawar
claim paper
Read More »
128
click to vote
ICALP
2004
Springer
93
views
Programming Languages
»
more
ICALP 2004
»
The Complexity of Partition Functions
16 years 18 days ago
Download
www2.informatik.hu-berlin.de
Andrei A. Bulatov, Martin Grohe
claim paper
Read More »
119
click to vote
ASAP
2003
IEEE
89
views
Hardware
»
more
ASAP 2003
»
Complex Division with Prescaling of Operands
16 years 15 days ago
Download
lara.inist.fr
Jean-Michel Muller
claim paper
Read More »
119
click to vote
ICCS
2003
Springer
74
views
Applied Computing
»
more
ICCS 2003
»
Efficient Implementation of Complex Particle Shapes in the Lattice Solid Model
16 years 12 days ago
Download
quakes.earth.uq.edu.au
Steffen Abe, Peter Mora
claim paper
Read More »
198
click to vote
FOCS
1991
IEEE
110
views
Theoretical Computer Science
»
more
FOCS 1991
»
Lower Bounds for the Complexity of Reliable Boolean Circuits with Noisy Gates
15 years 10 months ago
Download
www.cs.brown.edu
We prove that the reliable computation of any Boolean function with sensitivity s requires Ω(s log s) gates if the gates of the circuit fail independently with a fixed positive...
Anna Gál
claim paper
Read More »
« Prev
« First
page 259 / 3334
Last »
Next »