OpenAlex
PricingAboutJobs
Log inGet started
Work

Computing Partial Information out of Intractable One — The First Digit of 2n at Base 3 as an Example

HTML

Year: 2002
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Mathematical Foundations of Computer Science 2002: 27th International Symposium, MFCS 2002 Warsaw, Poland, August 26–30, 2002 Proceedings
DOI: 10.1007/3-540-45687-2_26
Authors: Mika Hirvensalo, Juhani Karhumäki
Institutions: University of Turku, Turku Centre for Computer Science
Language: English

Topic: Complexity and Algorithms in Graphs
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: incomplete information, computational intractability, ternary representation, polynomial-time computation, binary exponentiation

Open Access status: closed
OpenAlex ID: W1608113003
FWCI: 0.681
Cites: 2
Cited by: 7
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security